Index sets and universal numberings
From MaRDI portal
Publication:716308
DOI10.1016/J.JCSS.2010.07.001zbMATH Open1251.03046OpenAlexW2100254722MaRDI QIDQ716308FDOQ716308
Authors: Sanjay Jain, Frank Stephan, Jason Teutsch 
Publication date: 28 April 2011
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2010.07.001
Recommendations
- Index sets and universal numberings
- scientific article; zbMATH DE number 4055599
- scientific article; zbMATH DE number 3926056
- Numerical index and renorming
- scientific article; zbMATH DE number 5263512
- Index sets in the arithmetical hierarchy
- Indexing and mathematical explanation
- Correspondences and index
Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- An introduction to Kolmogorov complexity and its applications
- Program size in restricted programming languages
- Classical recursion theory. The theory of functions and sets of natural numbers
- Extremes in the degrees of inferability
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Enumerations of the Kolmogorov function
- Control structures in hypothesis spaces: The influence on learning
- Post's Programme for the Ershov Hierarchy
- Theory and Applications of Models of Computation
- A proof of Beigel's cardinality conjecture
- Frequency computations and the cardinality theorem
- On the complexity of random strings
- A guided tour of minimal indices and shortest descriptions
- On the Turing degrees of minimal index sets
- A cardinality version of Beigel's nonspeedup theorem
Cited In (8)
- Index sets and universal numberings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effectivity questions for Kleene's recursion theorem
- On approximate decidability of minimal programs
- Things that can be made into themselves
- On the Turing degrees of minimal index sets
- Enumerations including laconic enumerators
This page was built for publication: Index sets and universal numberings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716308)
