The Turing universe in the context of enumeration reducibility

DOI10.1007/978-3-642-39053-1_44MaRDI QIDQ5326385zbMATH OpenOpenAlexFDO

Authors Mariya I. Soskova

Publication date 5 August 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-39053-1_44

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Enumeration reducibility and computable structure theory
• scientific article; zbMATH DE number 4160710
• Computability and randomness
• On principles of computability on admissible sets
• Computability theory

Cited in

(4)

• Effectivity and reducibility with ordinal Turing machines
• Universality of Wolfram’s 2, 3 Turing Machine
• Games iteration numbers. A philosophical introduction to computability theory
• Logical Approaches to Computational Barriers

This page was built for publication: The Turing universe in the context of enumeration reducibility

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