Fundamentals of Computation Theory

DOI10.1007/11537311zbMATH Open1123.03034OpenAlexW2491671784MaRDI QIDQ5492952FDOQ5492952

Authors: Klaus Meer, Martin Ziegler 

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11537311

Recommendations

• An explicit solution to Post's problem over the reals
• Logical Approaches to Computational Barriers
• Strong Turing degrees for additive BSS RAM's
• Post's problem for supertasks has both positive and negative solutions
• Noncomputable functions in the Blum-Shub-Smale model

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other Turing degree structures (03D28) Turing machines and related notions (03D10)

Cited In (7)

• Logical Approaches to Computational Barriers
• On relativizations of the P =? NP question for several structures
• Discussion on “An effective method for the explicit solution of sequential problems on the real line” by Sören Christensen
• A hierarchy below the halting problem for additive machines
• Post's problem for supertasks has both positive and negative solutions
• Kolmogorov Complexity Theory over the Reals
• An explicit solution to Post's problem over the reals

This page was built for publication: Fundamentals of Computation Theory

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