On 0′-computable reals
TL;DR: The immunity properties of Az are studied: it is proved that it cannot be (co-)hyperhyperimmune but it is always bi-hyperimmune or (co-hypersimple if x is non-computable.
read more
About: This article is published in Electronic Notes in Theoretical Computer Science. The article was published on 01 Jul 2002. and is currently open access. The article focuses on the topics: Turing degree & Degree (graph theory).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Book
Computable Analysis : An Introduction
Klaus Weihrauch
- 12 Mar 2014
TL;DR: This book provides a solid fundament for studying various aspects of computability and complexity in analysis and is written in a style suitable for graduate-level and senior students in computer science and mathematics.
1.6K
•Book
Classical recursion theory
Piergiorgio Odifreddi
- 01 Jan 1989
TL;DR: Theories of Recursive functions, Hierarchies of recursive functions, and Arithmetical sets: Recursively enumerable sets.
1.1K
•Book
Computability in analysis and physics
Marian Boykan Pour-El,J. Ian Richards +1 more
- 01 Jan 1989
TL;DR: This book represents the first treatment of computable analysis at the graduate level within the tradition of classical mathematical reasoning and is sufficiently detailed to provide an introduction to research in this area.
1K
•Book
Computable Analysis
Klaus Weihrauch
- 01 Jan 2000
TL;DR: Computable analysis as discussed by the authors studies functions on the real numbers and related sets which can be computed by machines such as digital computers, and connects two traditionally disjoint fields, namely Analysis/Numerical Analysis on the one hand and Computability/Computational Complexity on the other hand, combining concepts of approximation and computation.
814