Taking the path computably traveled
- 23 August 2019
- journal article
- research article
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 29 (6) , 969-973
Abstract
We define a real $A$ to be low for paths in Baire space (or Cantor space) if every $\varPi ^0_1$ class with an $A$-computable element has a computable element. We prove that lowness for paths in Baire space and lowness for paths in Cantor space are equivalent and, furthermore, that these notions are also equivalent to lowness for isomorphism.
Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- The Isometry Degree of a Computable Copy of $\ell ^p$2018
- Lowness for isomorphism and degrees of genericityComputability, 2017
- Degrees that Are Low for IsomorphismComputability, 2014
- Algorithmic Randomness and Complexity2010
- An extension of the recursively enumerable Turing degreesJournal of the London Mathematical Society, 2007
- Computability in Analysis and Physics1989