Skip to content

Commit 75d1391

Browse files
Create README.md
1 parent 2a6b991 commit 75d1391

File tree

1 file changed

+19
-0
lines changed

1 file changed

+19
-0
lines changed

README.md

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
# GameOfLifeALISP
2+
Some work on the paper, "Automated Lie-algebraic input space partitioning using
3+
first-order two-dimensional cellular automata" by me (Shrohan Mohapatra. (2020, June 5).
4+
Automated Lie-algebraic input space partitioning using first-order two-dimensional cellular
5+
automata. Zenodo. http://doi.org/10.5281/zenodo.3880404), here in the specific example with
6+
Game of Life for automated Lie-algebraic input space partitioning.
7+
8+
There have been studies that analyse and apply input space partitioning by categorising them into
9+
classes such as equivalence partitioning, boundary value testing, category partitions, domain testing,
10+
classification trees, etc. This paper proposes a new algorithm for automated input domain modeling with
11+
randomised test case generation in a classification tree adhering to some Lie-algebraic structures
12+
using a scalable parallelised framework of first-order two-dimensional cellular automata that
13+
encompasses a large number of test cases simultaneously. As a proof of concept, this computational
14+
system is compared to a physical system described by a Yang-Mills theory of hypothetical quanta of
15+
certain gauge-invariant fields that follow the symmetries followed by the Lie algebras considered,
16+
in the foreground of the chaotic system as a continuum limit of the cellular automata, and the test
17+
cases are compared to the corresponding Feynman diagrams. Brief complexity analyses and brief
18+
analogies between the proof and the Feynman diagrammatics, algebraic complexity theory, and finite
19+
difference methods have also discussed.

0 commit comments

Comments
 (0)