Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a22684f9c9e65cd4

Jump to content

List of computability and complexity topics

From Wikipedia, the free encyclopedia
(Redirected from Outline of computability)

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).

Calculation

[edit]

Computability theory: models of computation

[edit]

Decision problems

[edit]

Definability questions

[edit]

Complexity theory

[edit]

Complexity classes

[edit]

Named problems

[edit]

Extensions

[edit]

See also

[edit]