Open AccessBook
Classical recursion theory
Reads0
Chats0
TLDR
Theories of Recursive functions, Hierarchies of recursive functions, and Arithmetical sets: Recursively enumerable sets.Abstract:
Preface. Introduction. Theories of Recursive functions. Hierarchies of recursive functions. Recursively enumerable sets. Recursively enumerable degrees. Limit sets. Arithmetical sets. Arithmetical degrees. Enumeration degrees. Bibliography. Notation index. Subject index.read more
Citations
More filters
Book ChapterDOI
Mathematical Foundations of Randomness
TL;DR: There are three key approaches for defining randomness in sequences: unpredictability, typicality, and incompressibility as discussed by the authors, which have dominated algorithmic randomness: Von Mises randomness, Martin-Lof randomness and Kolmogorov complexity.
Journal ArticleDOI
Mind change efficient learning
Wei Luo,Oliver Schulte +1 more
TL;DR: It is shown that the characteristic property of strongly mind change optimal learners is that they output conjectures (languages) with maximal accumulation order, which is related to other established notions of structural complexity, such as thickness and intrinsic complexity.
Journal ArticleDOI
The importance of Π⁰₁ classes in effective randomness
TL;DR: A number of results in effective randomness are proved, including the fact that every PA Turing degree is the join of two random Turing degrees, and the existence of a minimal pair of LR degrees below the LR degree of the halting problem.
Journal ArticleDOI
A semantical proof of De Jongh's theorem
TL;DR: By a refinement of De Jongh's original method, a semantical proof is given of a result that is almost as good as Leivant's, and maximality of intuitionistic predicate calculus is established wrt.
Journal ArticleDOI
Subspaces of computable vector spaces
Rodney G. Downey,Denis R. Hirschfeldt,Asher M. Kach,Steffen Lempp,Joseph R. Mileti,Antonio Montalbán +5 more
TL;DR: In this article, the existence of a nontrivial proper subspace of a vector space of dimension greater than one (over an infinite field) is shown to be equivalent to WKL 0 over RCA 0.