Definability by turing machines

DOI10.1002/MALQ.19690152002MaRDI QIDQ5595160zbMATH OpenOpenAlexFDO

Authors Robert M. Baer

Publication date 1969

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19690152002

zbMATH Keywords

recursion theory, constructive mathematics

Recommendations

• Definability in the Turing degrees
• scientific article; zbMATH DE number 2151710
• Computability and Definability
• Turing Definability in the Ershov Hierarchy
• Decidability of definability
• scientific article; zbMATH DE number 1467185
• Computational inductive definability
• Turing machine computations in finitely axiomatizable theories
• Definability issues in the -Turing degrees
• Formalizing Turing Machines

Cited in

(5)

• Formalizing Turing Machines
• scientific article; zbMATH DE number 4045156 (Why is no real title available?)
• scientific article; zbMATH DE number 3521955 (Why is no real title available?)
• scientific article; zbMATH DE number 732055 (Why is no real title available?)
• scientific article; zbMATH DE number 2226385 (Why is no real title available?)

This page was built for publication: Definability by turing machines

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