OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Blum's speedup theorem

 Home Mathematics Fields of mathematics Discrete mathematics Theorems in discrete mathematics Theorems in computational complexity theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Blum's speedup theorem is a result in the field of computational complexity theory, specifically dealing with the relationship between the time complexity of algorithms and the computation of functions. Formulated by Manuel Blum in the 1960s, the theorem essentially asserts that if a certain function can be computed by a deterministic Turing machine within a certain time bound, then there exists an alternative algorithm (or Turing machine) that computes the same function more quickly.

 Ancestors (6)

  1. Theorems in computational complexity theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook