The Turing degrees for some computation model with the real parameter

DOI10.2969/JMSJ/06020311MaRDI QIDQ930625zbMATH OpenOpenAlexFDO

Authors Yoshimi Yonezawa

Publication date 1 July 2008

Published in Journal of the Mathematical Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2969/jmsj/06020311

zbMATH Keywords

Turing degreeB.S.S. recursive function

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• The Arithmetical Hierarchy Over the Reals
• Real computations with fake numbers
• Publication:4938618
• scientific article; zbMATH DE number 1257074
• scientific article; zbMATH DE number 517066

Cites work

• scientific article; zbMATH DE number 3785004 (Why is no real title available?)
• scientific article; zbMATH DE number 503387 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• A new decision method for elementary algebra
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: The Turing degrees for some computation model with the real parameter

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