Stephen Wolfram's: A New Kind of Science | Online
Jump to Page
Look Up in Index

Chapter 12 > Section 8 > Page 764 Previous page-----Next page


Page image


Notes related to this page:

* [Classes of] fast algorithms
* Computational complexity theory
* History [of computational complexity theory]
* Lower bounds [on computational complexity]
* Algorithmic complexity theory
* [One-sided] Turing machines
* Longest halting times [in Turing machines]
* [Turing] machine 600720
* Growth rates [of functions]
* Implementation [of Turing machines]
* Number of [Turing machine] rules
* Numbering scheme [for Turing machines]
* History [of Turing machines]
* Long halting times [in symbolic systems]
* Factoring integers
* Turing machine enumeration
* All notes for this section
* Downloadable programs for this page
* Downloadable images
* Search Forum for this page
* Post a comment
* NKS | Online FAQs
From Stephen Wolfram: A New Kind of Science [citation] Previous page-----Next page