You are using a browser not supported by the Wolfram Cloud
Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.
I understand and wish to continue anyway »
WOLFRAM NOTEBOOK
Foliation
Foliation
A foliation is an update ordering
A foliation is an update ordering
For non-interfering events (i.e. spacelike events) you can do any set you want at the same time
Generations correspond to “thick” collections of update events
Generations correspond to “thick” collections of update events
In[]:=
MultiwaySystem[{"A""BB","B""A"}"Random","A",12,"CausalGraph"]
Out[]=
Is Sequential a tachyonic foliation?
Is Sequential a tachyonic foliation?
In[]:=
MultiwaySystem[{"A""BB","B""A"}"Sequential","A",12,"CausalGraph"]
Out[]=
In[]:=
MultiwaySystem[{"A""AB","B""A"}"Sequential","A",12,"CausalGraph"]
Out[]=
In[]:=
MultiwaySystem[{"A""AA","AAB""BA"}"Sequential","A",12,"CausalGraph"]
Out[]=
In[]:=
MultiwaySystem[{"AA""A","AB""BAA"}"Sequential","AABA",4,"CausalGraph"]
Out[]=
In[]:=
MultiwaySystem[{"A""B"}"Sequential","AAA",2,"CausalGraph"]
Out[]=
In[]:=
MultiwaySystem[{"C""AAA","A""B"}"Sequential","C",4,"CausalGraph"]
Out[]=
In[]:=
MultiwaySystem[{{0,1,0}{0,0,1},{0}{0,1,0}}"Sequential",{1,0,1,0},20,"CausalGraph"]
Out[]=
In[]:=
TotalCausalInvariantQ[{{0,1,0}{0,0,1},{0}{0,1,0}},4]
Out[]=
True
Sequential is depth-first search..... (which never recurses back up the tree if the rule doesn’t terminate)
Sequential is depth-first search..... (which never recurses back up the tree if the rule doesn’t terminate)
“Generations” is breadth-first search
“Generations” is breadth-first search
Least-recent first....
The standard StringReplace update ordering
The standard StringReplace update ordering
As many as it can without overlapping.......
In[]:=
ResourceFunction["SequentialSubstitutionSystemPlot"][ResourceFunction["SequentialSubstitutionSystem"][{{0,1,0}{0,0,1},{0}{0,1,0}},{1,0,1,0},50]]
Out[]=
Foliation specification
Foliation specification
What branch of the multiway system are you taking?
What branch of the multiway system are you taking?
At each step, you have a list of possible replacements ... you need EventSelectionFunction
At each step, you have a list of possible replacements ... you need EventSelectionFunction
Preferring the left; preferring the right
Sequential updates: traveling at the speed of light
Consider fixed-length strings
“strong hyperbolicity”
For each point, pick a sequence of delays between updatings....
Priority list where at every step each position gets a priority
(i.e. this is a list of positions to update in order)
(i.e. this is a list of positions to update in order)
To make the picture above, coarse grain this, showing only every ___ steps
Need an ergodic sequence to do something interesting....
Left-right scan......