scientific article; zbMATH DE number 4145891

MaRDI QIDQ3476803zbMATH OpenFDO

Authors Ivan N. Soskov

Publication date 1987

zbMATH Keywords

parallel procedurespartial structuresprime computability

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• scientific article; zbMATH DE number 4154430
• Publication:3483273
• Computability by nondeterministic program and the Moschovakis search computability
• Definability via enumerations
• scientific article; zbMATH DE number 2084366

Cited in

(9)

• Computability by means of effectively definable schemes and definability via enumerations
• Computability by nondeterministic program and the Moschovakis search computability
• Prime automata do not exist
• Prime factorizations of abstract domains using first-order logic
• Irreducibles and Primes in Computable Integral Domains
• scientific article; zbMATH DE number 4154429 (Why is no real title available?)
• Prime models and almost decidability
• scientific article; zbMATH DE number 7809184 (Why is no real title available?)
• Ivan Soskov: a life in computability

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3476803)