Search Results for author:
Found 3 papers, 0 papers with code
SimpleTRON: Simple Transformer with O(N) Complexity
In this paper, we propose that the dot product pairwise matching attention layer, which is widely used in Transformer-based models, is redundant for the model performance.
Classification of Discrete Dynamical Systems Based on Transients
To show that our approach can be applied to many different computational systems, we demonstrate the results of classifying cellular automata, Turing machines, and random Boolean networks.
Computational Hierarchy of Elementary Cellular Automata
We compute a graph showing which elementary cellular automata can be emulated by which and show that certain chaotic automata are the only ones that cannot emulate any automata non-trivially.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
