Numberings, c.e. oracles, and fixed points
From MaRDI portal
Publication:6062177
DOI10.3233/com-210387OpenAlexW4386256056MaRDI QIDQ6062177
Publication date: 30 November 2023
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-210387
fixed pointcomputable numberingArslanov completeness criterionminimal numberinghigh setprecomplete numberingcomplete numberingweakly precomplete numbering
Related Items (1)
Cites Work
- Some applications of computable one-one numberings
- On weakly pre-complete positive equivalences
- Computable single-valued numerations
- Handbook of computability theory
- Fixed point theorems for precomplete numberings
- Inductive inference and computable numberings
- On inseparable pairs
- Turing Computability
- A Survey on Universal Computably Enumerable Equivalence Relations
- Gödel numberings of partial recursive functions
- ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
- CONSTRUCTIVE ALGEBRAS I
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- The degrees of bi‐immune sets
- Degrees in Which the Recursive Sets are Uniformly Recursive
- [Russian Text Ignored]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Numberings, c.e. oracles, and fixed points