List Of Computability And Complexity Topics
This is a list of computability and complexity topics, by Wikipedia page.
Computability theory is the part of the theory of computation that deals with what can be computed, in principle. Computational complexity theory deals with how hard computations are, in quantitative terms, both with upper bounds (algorithms whose complexity in the worst cases, as use of computing resources, can be estimated), and from below (proofs that no procedure to carry out some task can be very fast).
For more abstract foundational matters, see the list of mathematical logic topics. See also list of algorithms, list of algorithm general topics.
Read more about List Of Computability And Complexity Topics: Calculation, Computability Theory: Models of Computation, Decision Problems, Definability Questions, Complexity Theory, Complexity Classes, Named Problems, Extensions
Famous quotes containing the words list of, list and/or complexity:
“A man’s interest in a single bluebird is worth more than a complete but dry list of the fauna and flora of a town.”
—Henry David Thoreau (1817–1862)
“Lastly, his tomb
Shall list and founder in the troughs of grass
And none shall speak his name.”
—Karl Shapiro (b. 1913)
“It is not only their own need to mother that takes some women by surprise; there is also the shock of discovering the complexity of alternative child-care arrangements that have been made to sound so simple. Those for whom the intended solution is equal parenting have found that some parents are more equal than others.”
—Elaine Heffner (20th century)