Embedding arbitrary Boolean circuits into fungal automata
From MaRDI portal
Publication:6109020
DOI10.1007/978-3-031-20624-5_24arXiv2208.08779MaRDI QIDQ6109020
Thomas Worsch, Augusto Modanese
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.08779
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (1)
Cites Work
- Unnamed Item
- Crossing information in two-dimensional sandpiles
- On uniform circuit complexity
- The computational complexity of sandpiles
- Computational universality of fungal sandpile automata
- The computational complexity of one-dimensional sandpiles
- How Hard is it to Predict Sandpiles on Lattices? A Survey
- Embedding arbitrary Boolean circuits into fungal automata
This page was built for publication: Embedding arbitrary Boolean circuits into fungal automata
