Real-valued affine automata compute beyond Turing machines
arXiv:2212.11834
Abstract
We show that bounded-error affine finite automata recognize uncountably many (and so some non-Turing recognizable) languages when using real-valued transitions.
8 pages