Decomposition Complexity
Alexander Shen (LIF)
TL;DR
This paper investigates how to decompose ternary functions into binary functions, exploring implications in communication complexity, information theory, and cellular automata to understand computational and informational structures.
Contribution
It introduces a new perspective on function decomposition, linking it to communication complexity and cellular automata applications, providing novel theoretical insights.
Findings
Decomposition complexity impacts communication protocols.
New bounds on function decomposition in cellular automata.
Connections established between information theory and function decomposition.
Abstract
We consider a problem of decomposition of a ternary function into a composition of binary ones from the viewpoint of communication complexity and algorithmic information theory as well as some applications to cellular automata.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · semigroups and automata theory · Computability, Logic, AI Algorithms