scientific article; zbMATH DE number 3995657
From MaRDI portal
Publication:4723720
zbMATH Open0615.03033MaRDI QIDQ4723720FDOQ4723720
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
Cited In (27)
- RANDOMNESS NOTIONS AND REVERSE MATHEMATICS
- Martin-Löf reducibility and cost functions
- Calculus of cost functions
- Title not available (Why is that?)
- On recursion theory in IΣ1
- Computing from projections of random points
- STRONG JUMP-TRACEABILITY
- Another note on the join property
- Π01-classes and Rado's selection principle
- Fixed-point selection functions
- Computably enumerable sets below random sets
- \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
- Precomplete numberings
- Fixed point theorems for precomplete numberings
- Computational processes, observers and Turing incompleteness
- Title not available (Why is that?)
- An easy priority-free proof of a theorem of Friedberg
- The complexity of recursive constraint satisfaction problems
- On relative randomness
- A DNC function that computes no effectively bi-immune set
- The noneffectivity of Arslanov's completeness criterion and related theorems
- GENERALIZATIONS OF THE RECURSION THEOREM
- Recursively presented games and strategies
- Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees
- 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)
