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).
Computational complexity theoryList of algorithm general topicsList of complexity classesList of computability & complexity topicsList of mathematical logic topicsLists of mathematics topicsMathematical logicOutline of complexityOutline of complexity and computabilityOutline of computabilityOutline of computability and complexity
Link from a Wikipage to another Wikipage
primaryTopic
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).
has abstract
This is a list of computabilit ...... t of algorithm general topics.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
945,894,891
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
comment
This is a list of computabilit ...... t some task can be very fast).
@en
label
List of computability and complexity topics
@en