ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S\mathcal{S} be a closed, discrete-time stochastic system over a state space X\mathcal{X}, and let its memory be

M=M(S)=sup⁡tsup⁡μIXt∼μ(Xt;Xt+1),M=\mathcal{M}(\mathcal{S})=\sup_t\sup_\mu I_{X_t\sim\mu}(X_t;X_{t+1}),

where the inner supremum ranges over all distributions μ\mu on X\mathcal{X} and I(Xt;Xt+1)I(X_t;X_{t+1}) denotes Shannon mutual information. Space-Bounded Church–Turing thesis. The problem of computing the asymptotic behavior of S\mathcal{S} with memory MM to within precision 2−n2^{-n} is in the complexity class

SPACE((M+log⁡n)O(1)).\mathbf{SPACE}((M+\log n)^{O(1)}).

This is presented as a concrete form of the Space-Bounded Church–Turing thesis, also called the Simulation Assertion in the cited source. The statement concerns the space complexity of computing long-term behavior from the system's information-preservation capacity; its resolution is not specified in the supplied text.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.