scientific article; zbMATH DE number 3841851

MaRDI QIDQ3312224zbMATH OpenFDO

Authors Ivan N. Soskov

Publication date 1983

zbMATH Keywords

algorithmic completeness of algebraic systemscomputabilitycountersflowchartspushdown stores

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computability and recursion theory (03D99) Other constructive mathematics (03F65)

Recommendations

• scientific article; zbMATH DE number 23020
• scientific article; zbMATH DE number 947381
• Approximate completeness in algebras of partial recursive functions and predicates
• scientific article; zbMATH DE number 4134025
• scientific article; zbMATH DE number 3868601

Cited in

(13)

• The necessary and sufficient condition of realizability of an algorithm in systems controlled by a flow of arguments
• scientific article; zbMATH DE number 4174907 (Why is no real title available?)
• scientific article; zbMATH DE number 3868601 (Why is no real title available?)
• scientific article; zbMATH DE number 3933053 (Why is no real title available?)
• Orthogonal completeness and algebraic systems
• Identical transformations in algebras of nondeterministic algorithms. I
• Identical transformations in algebras of nondeterministic algorithms. II
• scientific article; zbMATH DE number 4060698 (Why is no real title available?)
• Approximate completeness in algebras of partial recursive functions and predicates
• scientific article; zbMATH DE number 2047479 (Why is no real title available?)
• Decidability of classes of algebraic systems in polynomial time
• scientific article; zbMATH DE number 7340317 (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 Q3312224)