A General Framework for Priority Arguments (1995)

Cached

Download Links

by Steffen Lempp , Manuel Lerman
Venue:THE BULLETIN OF SYMBOLIC LOGIC
Citations:2 - 0 self

Active Bibliography

1 Introduction Degrees of Unsolvability – Klaus Ambos-spies, Peter A. Fejer - 2006
6 Noncomputable Spectral Sets – Jason Teutsch, Janos Simon Ph. D, Kevin Zumbrun Ph. D, Jason Teutsch, Love The Ma - 2007
EMBEDDINGS INTO THE COMPUTABLY ENUMERABLE DEGREES – M. Lerman
Computability Theory, Algorithmic Randomness and Turing’s Anticipation – Rod Downey
4 Conjectures and Questions from Gerald Sacks’s Degrees of Unsolvability – Richard A. Shore - 1993
EMBEDDINGS INTO THE TURING DEGREES. – Antonio Montalb Án - 2007
1 Computational Processes, Observers and Turing Incompleteness – Klaus Sutner
144 On the Power of Randomization in Online Algorithms – S. Ben-David, A. Borodin, R. Karp, G. Tardos, A. Wigderson - 1990
36 Parameter Definability in the Recursively Enumerable Degrees – Andre Nies