高兴一回
发表于 2025-3-23 12:46:58
Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automatapeeds, and rational initial positions. In these SM, signals are always contained inside a regular mesh. The discretization brings forth the corresponding discrete mesh. The simulation is valid on any infinite run and preserves the relative position of collisions.
subordinate
发表于 2025-3-23 16:33:25
https://doi.org/10.1007/978-3-322-86013-2e. We then show that on sofic groups, where it is known that injective cellular automata are surjective, post-surjectivity implies pre-injectivity. As no non-sofic groups are currently known, we conjecture that this implication always holds. This mirrors Gottschalk’s conjecture that every injective cellular automaton is surjective.
Grievance
发表于 2025-3-23 21:03:15
http://reply.papertrans.cn/23/2230/222992/222992_13.png
使激动
发表于 2025-3-24 00:50:35
http://reply.papertrans.cn/23/2230/222992/222992_14.png
bifurcate
发表于 2025-3-24 02:59:04
http://reply.papertrans.cn/23/2230/222992/222992_15.png
LUDE
发表于 2025-3-24 09:19:35
http://reply.papertrans.cn/23/2230/222992/222992_16.png
Spinal-Tap
发表于 2025-3-24 12:43:36
https://doi.org/10.1007/978-3-322-86012-5icular state. In this setting we study the monoid of Turing machines and the group of reversible Turing machines. We also study two natural subgroups, namely the group of finite-state automata, which generalizes the topological full groups studied in the theory of orbit-equivalence, and the group of
健忘症
发表于 2025-3-24 18:16:54
https://doi.org/10.1007/978-3-322-86012-5g the key concept of signals/particles and collisions. Inside a Euclidean space, dimensionless signals move freely; collisions are instantaneous. Today’s issue is the automatic generation of a CA . a given SM. On the one hand, many ad hoc manual conversions exist. On the other hand, some irrational
Painstaking
发表于 2025-3-24 21:23:56
https://doi.org/10.1007/978-3-322-86013-2igurations, every pre-image of one is asymptotic to a pre-image of the other. The well known dual concept is pre-injectivity: a cellular automaton is pre-injective if distinct asymptotic configurations have distinct images. We prove that pre-injective, post-surjective cellular automata are reversibl
ADORN
发表于 2025-3-25 00:12:14
Cellular Automata and Discrete Complex Systems978-3-319-39300-1Series ISSN 0302-9743 Series E-ISSN 1611-3349