Mathematics & Statisticshttp://hdl.handle.net/10464/61542024-03-28T13:04:10Z2024-03-28T13:04:10ZDemonstration of deterministic diffusion in two dimensionsFukś, Henrykhttp://hdl.handle.net/10464/182102023-12-18T17:37:14Z2023-12-18T00:00:00ZDemonstration of deterministic diffusion in two dimensions
Fukś, Henryk
Video recording (animation) of the time evolution of deterministic cellular automaton emulating diffusion in 2D. Detailed description of the cellular automaton in: H. Fukś, Four state deterministic cellular automaton rule emulating random diffusion. In B. Chopard, editor, Cellular Automata, ACRI 2022, LNCS 13402, pages 142--152. Springer, 2022, http://dx.doi.org/10.1007/978-3-031-14926-9_13 .
Lattice 250x250 with periodic boundary. Only every 10 steps are shown, total 1000 frames, corresponding to 10000 time steps.
2023-12-18T00:00:00ZDeterministic cellular automaton rule emulating 2D diffusionFukś, Henrykhttp://hdl.handle.net/10464/182092023-12-18T17:21:59Z2023-12-18T00:00:00ZDeterministic cellular automaton rule emulating 2D diffusion
Fukś, Henryk
Files defining 8-state cellular automaton emulating diffusion in 2 dimensions. Rule definition is in golly's .rule format. Sample initial pattern is included. Details of the rule are described in: H. Fukś. Four state deterministic cellular automaton rule emulating random diffusion. In B. Chopard, editor, Cellular Automata, ACRI 2022, LNCS 13402, pages 142--152. Springer, 2022,
http://dx.doi.org/10.1007/978-3-031-14926-9_13 .
2023-12-18T00:00:00ZDemonstration of density classification by two 2D probabilistic cellular automataFukś, Henrykhttp://hdl.handle.net/10464/182082023-12-15T18:27:58Z2023-12-15T00:00:00ZDemonstration of density classification by two 2D probabilistic cellular automata
Fukś, Henryk
Demonstration of the solution of the density classification problem for initial density 0.501, performed by a pair of 2D cellular automaton rules described in H. Fukś, "Solving two-dimensional density classification problem with two probabilistic cellular automata", Journal of Cellular Automata, 10(1--2):149--160, 2015 (also availabe at https://arxiv.org/abs/1506.06653). The rules used are generalized ECA 184 with random "lane changes" and generalized ECA 232 with random "crowd avoidance".
Video file with resolution 418x416, 1 min 10 sec duration. Black sites represent 0, blue represent 1. Initial configuration is 100x100 with density 0.501, meaning that there are 5100 sites in state 1 and 4900 in state 0. Periodic boundary conditions are used.
The rule changes after 1000 iterations (approx. in 42 sec.) , and at the end all sites are blue (in state 1), as expected for the initial density > 0.5.
2023-12-15T00:00:00ZProgram constructing lunar tables for ecclesiastical moonFukś, Henrykhttp://hdl.handle.net/10464/182052023-12-15T15:31:39Z2023-12-15T00:00:00ZProgram constructing lunar tables for ecclesiastical moon
Fukś, Henryk
Python program producing lunar tables similar to those found in Martyrologium Romanum. Its main purpose is to determine the age of the eccesiastical moon on a given calendar day, using algorithm given in Martylorogium Romanum and implemented as described in H. Fukś, Antiquitates Mathematicae, Vol 16 (2022) , 259-282.
2023-12-15T00:00:00Z