OpenAlex
PricingAboutJobs
Log inGet started
Work

Degrees of computability and randomness

HTML PDF

Year: 2009
Type: dissertation
Source: White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)
Author: Anthony Morphett
Language: English

Topic: Computability, Logic, AI Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: computability theory, randomness, Turing degrees, computably enumerable sets, algorithmic randomness

Open Access status: green
OpenAlex ID: W2269961563
Cites: 60
Cited by: 2
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security