Skip to main content
. 2022 May 23;380(2227):20200429. doi: 10.1098/rsta.2020.0429

Table 1.

Table of mathematical notation and acronyms

Iac(x) the size of the algorithmic information content of an encoded object x Section 2
Iac(y|x) the size of the (conditional) algorithmic information content of an encoded object y given an encoded object x Section 2
FDDDS acronym for finite discrete deterministic dynamical system Section 2
c I  constant that determines the equivalence class Iac() Section 2
St a single state of a FDDDS S at time instant t Section 2
Stt a state space trajectory (St,,St) of S from the state St until state St Section 2
P an algorithmic perturbation Section 3
O an observer Turing machine, which is a particular type of two-tape Turing machine whose first tape receives input and the second tape stores formal knowledge ([1], Section 3.2)
O a formal observer system, which is a particular type of FDDDS that simulates O Section 3
St a single state of S at time instant t that occurs after S being perturbed/observed at any time instant <t Section 3
cO constant that determines the minimum conditions for the observation to take place Section 3
ODE acronym for observer-dependent emergence Section 3a
ce constant that determines the minimum conditions for observer-dependent emergence Section 3a
AOIE acronym for asymptotically observer-independent emergence Section 3b
P a sequence (or collection) of Turing machines Section 3b(i)
S a discrete deterministic dynamical system whose each contiguous subsequence of its entire state space trajectory is a state space trajectory of a particular FDDDS S(k) Section 3b(ii)
S a macro-level discrete deterministic dynamical system whose micro-level systems (or parts) cannot interact with each other Section 3b(ii)
S a macro-level discrete deterministic dynamical system whose micro-level systems (or parts) do interact with each other Section 3b(ii)