Skip to main content

Space-Bounded Church-Turing Thesis and Computational Tractability of Closed Systems

Author(s): Braverman, Mark; Schneider, J; Rojas, C

To refer to this page use:
Abstract: We report a new limitation on the ability of physical systems to perform computation - one that is based on generalizing the notion of memory, or storage space, available to the system to perform the computation. Roughly, we define memory as the maximal amount of information that the evolving system can carry from one instant to the next. We show that memory is a limiting factor in computation even in lieu of any time limitations on the evolving system - such as when considering its equilibrium regime. We call this limitation the space-bounded Church-Turing thesis (SBCT). The SBCT is supported by a simulation assertion (SA), which states that predicting the long-term behavior of bounded-memory systems is computationally tractable. In particular, one corollary of SA is an explicit bound on the computational hardness of the long-term behavior of a discrete-time finite-dimensional dynamical system that is affected by noise. We prove such a bound explicitly
Publication Date: 27-Aug-2015
Electronic Publication Date: 2015
Citation: Braverman, M, Schneider, J, Rojas, C. (2015). Space-Bounded Church-Turing Thesis and Computational Tractability of Closed Systems. Physical Review Letters, 115 (10.1103/PhysRevLett.115.098701
DOI: doi:10.1103/PhysRevLett.115.098701
Type of Material: Journal Article
Journal/Proceeding Title: Physical Review Letters
Version: Author's manuscript

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.