scientific article; zbMATH DE number 1136098

MaRDI QIDQ4381408zbMATH OpenFDO

Authors S. Barry Cooper

Publication date 10 February 1999

zbMATH Keywords

automorphismsdefinabilityinformation contentmaterial universeuncomputabilityundecidability

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Undecidability and degrees of sets of sentences (03D35) Applications of computability and recursion theory (03D80)

Recommendations

• scientific article; zbMATH DE number 1405574
• scientific article; zbMATH DE number 1048039
• Is Turing's thesis the consequence of a more general physical principle?
• The Extended Turing Model as Contextual Tool
• scientific article; zbMATH DE number 1820020

Cited in

(6)

• Self-referential noise and the synthesis of three-dimensional space
• Definability as hypercomputational effect
• Turing Jumps Through Provability
• scientific article; zbMATH DE number 1048039 (Why is no real title available?)
• Non-erasing turing machines: A new frontier between a decidable halting problem and universality
• Beyond Rogers’ Non-constructively Computable Function

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