2000 character limit reached
Real-valued affine automata compute beyond Turing machines (2212.11834v1)
Published 22 Dec 2022 in cs.FL and cs.CC
Abstract: We show that bounded-error affine finite automata recognize uncountably many (and so some non-Turing recognizable) languages when using real-valued transitions.