A infinite "tape" of finite symbols.
A "head" with an internal state that
can advance only one spot at a time.
A finite set of instructions:
given a state and symbol perform set action.
++++++++++[>+++++++>++++++++++>+++>+<<<< -]>++.>+.+++++++..+++.>++.<<+++++++++++++++ .>.+++.------.--------.>+.>.
vv < < 2 ^ v< v1>3v4 ^ ^ > >?> ?>5^ v v v9>7v6 v v< 8 . > > ^ ^<
Given the state of the program: the next action is taken
according to a probability distribution
Getting even trivial programs to have a reliable output is often a monumental task. Useful for exploring large search spaces, quantum computing, machine learning, ...
How many ideas of physics can be
expressed under the C&L topology?
Chutes and Ladders Potential Function?
C&L does not possess a typical energy landscape; rather it is a stochastically driven process with discrete jumps.
Single player Game Length Attention Span
, , , , ,
Exponential Maps, and flows give rise to a differential-mapping. A set of coupled first-order differential equations has a natural connection to Markov chains:
The Markov matrix is the generator of the rate matrix at a given time:
Assume that the die rolls now represent rates (like a chemical equation), i.e. the first roll would be:
This system of equations can be exponential to give a continuous-time Markov game.
Note the abissica on the second picture,
we are modeling fractions of a die roll!