Last modifications on Fri, Nov 24, 1995.

Modern Analog Field Computing:
Computability and Complexity

Table of Contents

• How to Use This Book
• History of Field Computing
• Theory
  • Computability
    • Turing-Completeness
    • Strong Church-Turing Hypothesis
    • Super-Turing Computation versus the Physics of Computing
    • Need for Weaker Results
      • Analog Chomsky Hierarchy
      • Calculi and Simulacra
      • The GPAC Is Not Turing-Complete
  • Complexity
    • Complexity of Analog Computation
    • Analysis of Field Computers
    • Thermodynamics and NP-Completeness