Infinite-Time Turing Machines and Borel Reducibility

DOI10.1007/978-3-642-03073-4_14zbMath1268.03047OpenAlexW1517394483MaRDI QIDQ3576045

Samuel Coskey

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_14

Mathematics Subject Classification ID

Descriptive set theory (03E15) Turing machines and related notions (03D10)

Cites Work

• A Borel reductibility theory for classes of countable structures
• P ≠ NP ∩ co-NP for Infinite Time Turing Machines
• Linear algebraic groups and countable Borel equivalence relations
• Infinite time Turing machines
• Borel equivalence relations and classifications of countable models
• Unnamed Item

This page was built for publication: Infinite-Time Turing Machines and Borel Reducibility