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 (categorize this paper)
Buy the book $21.74 used (83% off)   $29.84 new (77% off)   $125.00 direct from Amazon    Amazon page
ISBN(s) 0199230765   9780199230761  
DOI 10.2178/bsl/1264433798
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 20,887
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Matthew Jura, Oscar Levin & Tyler Markkanen (2016). A-Computable Graphs. Annals of Pure and Applied Logic 167 (3):235-246.

View all 15 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index

2010-08-17

Total downloads

3 ( #620,903 of 1,907,337 )

Recent downloads (6 months)

1 ( #466,442 of 1,907,337 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.