scientific article; zbMATH DE number 65747

MaRDI QIDQ4010358zbMATHFDO

Authors Neil D. Jones

Publication date 27 September 1992

zbMATH Keywords

recursion theoremcompiler generatorscomputable functionKleene fixed- points-m-n theorem

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80)

Recommendations

• Applications of the Kleene-Kreisel density theorem to theoretical computer science
• scientific article; zbMATH DE number 1678376
• scientific article; zbMATH DE number 5778850
• scientific article; zbMATH DE number 738396
• scientific article; zbMATH DE number 702378
• Recursion theory. Computational aspects of definability
• Programming and automating mathematics in the Tarski-Kleene hierarchy
• scientific article; zbMATH DE number 408802
• Finitely recursive programs: decidability and bottom-up computation

Cited in

(4)

• Composition is almost (but not quite) as good as \(s-1-1\)
• Polynomially bounded recursive realizability
• Kleene's amazing second recursion theorem
• A Swiss pocket knife for 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 Q4010358)