scientific article; zbMATH DE number 3823137

MaRDI QIDQ3668865zbMATH OpenFDO

Authors Andrei P. Ershov

Publication date 1982

zbMATH Keywords

abstract computabilityarithmeticscomputation processconstructive mathematicsdiophantine computabilityeffective computabilityoperational algorithmsprogram determinantrecursive definabilityrecursive programsTuring machines

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Other constructive mathematics (03F65) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(2)

• Composition aspects of programmology. I
• Primitive program algebras of computable functions

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 Q3668865)