The Mermin fixed point
Veit Elser
Abstract
The most efficient known method for solving certain computational problems is to construct an iterated map whose fixed points are by design the problem's solution. Although the origins of this idea go back at least to Newton, the clearest expression of its logical basis is an example due to Mermin. A contemporary application in image recovery demonstrates the power of the method.
Create a lesson
Related papers
A repeating sequence of simple rules creates a universal computer
Riz Fernando Noronha
Analytical derivation of a three-dimensional fundamental diagram for a real-valued max-plus particle system
Daisuke Takahashi, Junta Matsukidaira, Kazuya Okamoto
Diagonal Bases and Diagonal Periods of Elementary Cellular Automata
Tigran Nersissian
Diagonal Periods and Newton Supports of Rules 30, 86 and 135
Tigran Nersissian
Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre
James Edmond
Optical free space extreme learning machine for the implementation of emergent complex systems
Elena Moreno, Fernando Soldevila, Daniel Torrent