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:
“My list of things I never pictured myself saying when I pictured myself as a parent has grown over the years.”
—Polly Berrien Berends (20th century)
“Thirty—the promise of a decade of loneliness, a thinning list of single men to know, a thinning brief-case of enthusiasm, thinning hair.”
—F. Scott Fitzgerald (1896–1940)
“In times like ours, where the growing complexity of life leaves us barely the time to read the newspapers, where the map of Europe has endured profound rearrangements and is perhaps on the brink of enduring yet others, where so many threatening and new problems appear everywhere, you will admit it may be demanded of a writer that he be more than a fine wit who makes us forget in idle and byzantine discussions on the merits of pure form ...”
—Marcel Proust (1871–1922)