An easy priority-free proof of a theorem of Friedberg

DOI10.1016/0304-3975(90)90141-4zbMath0701.03018OpenAlexW1995925155MaRDI QIDQ913786

N. E. Zubov

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90141-4

zbMATH Keywords

numberingspartial recursive functionsrecursively enumerable classes

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45)

Related Items

Definitional schemes for primitive recursive and computable functions ⋮ NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS ⋮ Diagonals and -maximal sets ⋮ Learning-theoretic perspectives of acceptable numberings ⋮ Effectively infinite classes of numberings of computable families of reals ⋮ Effectively infinite classes of numberings and computable families of reals ⋮ Learnability and positive equivalence relations ⋮ Learning in Friedberg numberings ⋮ Numberings and Randomness ⋮ Friedberg numberings of families of partial computable functionals ⋮ On recursive enumerability with finite repetitions ⋮ Learnability and positive equivalence relations ⋮ Some applications of computable one-one numberings ⋮ On Approximate Decidability of Minimal Programs

Cites Work

• CSL '88. Proceedings. 2nd workshop on computer science logic, Duisburg, Germany, October 3-7, 1988
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Unnamed Item
• Unnamed Item
• Unnamed Item