scientific article; zbMATH DE number 3995657

MaRDI QIDQ4723720zbMATH OpenFDO

Authors Antonín Kučera

Publication date 1986

zbMATH Keywords

reducibilityPeano arithmeticdegreePost's problempriority-free method

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Publication:3484821
• scientific article; zbMATH DE number 1747699
• An easy priority-free proof of a theorem of Friedberg
• On recursion theory in IΣ₁
• scientific article; zbMATH DE number 3981159

Cited in

(27)

• Martin-Löf reducibility and cost functions
• scientific article; zbMATH DE number 1747699 (Why is no real title available?)
• Calculus of cost functions
• On recursion theory in IΣ₁
• Computing from projections of random points
• Minimal weak truth table degrees and computably enumerable Turing degrees
• Another note on the join property
• Π₀¹-classes and Rado's selection principle
• Computably enumerable sets below random sets
• Fixed-point selection functions
• Randomness notions and reverse mathematics
• \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
• Precomplete numberings
• Fixed point theorems for precomplete numberings
• Computational processes, observers and Turing incompleteness
• An easy priority-free proof of a theorem of Friedberg
• scientific article; zbMATH DE number 4156422 (Why is no real title available?)
• The complexity of recursive constraint satisfaction problems
• On relative randomness
• Strong jump-traceability
• A DNC function that computes no effectively bi-immune set
• The noneffectivity of Arslanov's completeness criterion and related theorems
• Recursively presented games and strategies
• GENERALIZATIONS OF THE RECURSION THEOREM
• Extending properly n - REA sets1
• Characterizing the strongly jump-traceable sets via randomness
• Demuth randomness and computational complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723720)