Chapter 12 Notes > Section 6

	Notes for Chapter 12: The Principle of Computational Equivalence Section 6: Computational Irreducibility History [of computational irreducibility] [History of] exact solutions Amount of computation [and computational irreducibility] More complicated rules [and reducibility] [Examples of] reducible systems Speed-up theorems [Computation of] mathematical functions Formulas [and computational irreducibility] [Examples of] short computations Intrinsic limits in science PAGE IMAGES RELATED LINKS Main text from section Downloadable programs for this section Downloadable images Search Forum for this section Post a comment NKS | Online FAQs

From Stephen Wolfram: A New Kind of Science [citation]