Switch to: Citations

References in:

Random reals and possibly infinite computations Part I: Randomness in ∅'

Verónica Becher & Serge Grigorieff

Journal of Symbolic Logic 70 (3):891-913 (2005)

Add references

You must login to add references.

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.details Areas of Mathematics in Philosophy of Mathematics Computability in Philosophy of Computing and Information Direct download Export citation Bookmark 700 citations
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.details The description for this book, Degrees of Unsolvability. (AM-55), Volume 55, will be forthcoming. Computability in Philosophy of Computing and Information Theory of Computation in Philosophy of Computing and Information $5.32 used $39.98 new View on Amazon.com Direct download (2 more) Export citation Bookmark 47 citations
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.details Computability in Philosophy of Computing and Information Philosophy of Mathematics $24.50 used $42.00 new $50.00 from Amazon View on Amazon.com Direct download (2 more) Export citation Bookmark 478 citations
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.details Logic and Philosophy of Logic Direct download Export citation Bookmark 594 citations
Descriptive Set Theory.Richard Mansfield - 1981 - Journal of Symbolic Logic 46 (4):874-876.details Logic and Philosophy of Logic Model Theory in Logic and Philosophy of Logic Direct download Export citation Bookmark 55 citations
[Pirḳe Avot] =.Joseph H. Hertz & Michoel Muchnik (eds.) - 1986 - [West Orange, N.J.]: Behrman House.details The complete Hebrew text illuminated by English transliteration and commentary in an illustrated gift edition. Judaism in Philosophy of Religion Direct download Export citation Bookmark 2 citations
A Highly Random Number.Veronica Becher & Sergio Daicz - unknowndetails many symbols. We define o, as the probability that an arbitrary machine be circular and we prove that o, is a random number that goes beyond.. No categories Export citation Bookmark 5 citations
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.details Logic and Philosophy of Logic Export citation Bookmark 161 citations

1