# Taking the path computably traveled

@article{Franklin2019TakingTP, title={Taking the path computably traveled}, author={Johanna N. Y. Franklin and Dan Turetsky}, journal={J. Log. Comput.}, year={2019}, volume={29}, pages={969-973} }

We define a real $A$ to be low for paths in Baire space (or Cantor space) if every $\Pi^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.

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 10 REFERENCES

## The Isometry Degree of a Computable Copy of 𝓁p

VIEW 1 EXCERPT

## Computability

VIEW 2 EXCERPTS

## Algorithmic Randomness and Complexity

VIEW 2 EXCERPTS

## 2 ,

VIEW 2 EXCERPTS

HIGHLY INFLUENTIAL

## Springer-Verlag

VIEW 1 EXCERPT