Computability and Randomness
Oup (2009)
| Abstract | Covering the basics as well as recent research results, this book provides a very readable introduction to the exciting interface of computability and ... | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Buy the book | Amazon page | |||||||||
| ISBN(s) | 0199230765 9780199230761 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesAntony Eagle, Chance Versus Randomness. Stanford Encyclopedia of Philosophy.
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
André Nies, Frank Stephan & Sebastiaan A. Terwijn (2005). Randomness, Relativization and Turing Degrees. Journal of Symbolic Logic 70 (2):515 - 535.
Stewart Shapiro (1980). On the Notion of Effectiveness. History and Philosophy of Logic 1 (1-2):209-230.
Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Stewart Shapiro (1983). Remarks on the Development of Computability. History and Philosophy of Logic 4 (1-2):203-220.
Rod Downey, Andre Nies, Rebecca Weber & Liang Yu (2006). Lowness and $\Pi _{2}^{0}$ Nullsets. Journal of Symbolic Logic 71 (3):1044 - 1052.
Joseph S. Miller & André Nies (2006). Randomness and Computability: Open Questions. Bulletin of Symbolic Logic 12 (3):390-410.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-17Total downloads1 ( #274,507 of 548,969 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
