Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Introduction
HTML
Details
Locations
Year:
2020
Type:
book-chapter
Source:
Princeton University Press eBooks
Parent work:
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206)
DOI:
10.23943/princeton/9780691199665.003.0001
Authors:
Rod Downey,
Noam Greenberg
Language:
English
Topic:
Computability, Logic, AI Algorithms
Subfield:
Computational Theory and Mathematics
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
computability theory,
computably enumerable sets,
Turing degrees,
algorithmic complexity,
history of computability
Open Access status:
closed
OpenAlex ID:
W4205307938
FWCI:
Cites:
Cited by:
Related to:
10