Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 

 

On a question of Slaman and Groszek


Author: Andrew E. M. Lewis
Journal: Proc. Amer. Math. Soc. 136 (2008), 3663-3668
MSC (2000): Primary 03D28
DOI: https://doi.org/10.1090/S0002-9939-08-09345-3
Published electronically: May 16, 2008
MathSciNet review: 2415052
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We answer a question of Slaman and Groszek by showing that any non-computable perfect tree computes one of its non-computable paths.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2000): 03D28

Retrieve articles in all journals with MSC (2000): 03D28


Additional Information

Andrew E. M. Lewis
Affiliation: Department of Mathematics, University of Leeds, Leeds, LS2 9JT England
Email: andy@aemlewis.co.uk

DOI: https://doi.org/10.1090/S0002-9939-08-09345-3
Received by editor(s): April 24, 2007
Received by editor(s) in revised form: August 31, 2007, and September 4, 2007
Published electronically: May 16, 2008
Additional Notes: The author was supported by the Marie-Curie Fellowship MEIF-CT-2005-023657 and partially supported by the NSFC Grand International Joint Project no. 60310213, New Directions in the Theory and Applications of Models of Computation.
Communicated by: Julia Knight
Article copyright: © Copyright 2008 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.