Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Degrees of computability and randomness
HTML
PDF
Details
Locations
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