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.

Calculation

Computability theory: models of computation

Decision problems

Definability questions

Complexity theory

Complexity classes

See the list of complexity classes

Named problems

Extensions

Computability and complexity

 

<< PreviousWord BrowserNext >>
prince2
tadeusz br komorowski
coat of arms of republika srpska
nidud
deep ecology (company)
upper silesian metropolitan area
sonic hedgehog
edie bukewihge
sapardi djoko damono
university of indonesia
rocky reach dam
after the funeral
list of final fantasy characters
box junction
eevee
vaporeon
mucia tertia
juan crisstomo falcn
jolteon
edward hunter
rock island dam
black backed woodpecker
wells dam
flag of afghanistan
wanapum dam
priest rapids dam
spotted crake
chicha
moldmaker
wenatchee river
little crake
grand coulee dam
ebbw vale
home army (disambiguation)
brigid of ireland
come
akashic brotherhood
celestial chorus
book of dimma
folk medicine
skandinaviska banken
sebakh
list of towns in northern ireland
foyles