Real-valued affine automata compute beyond Turing machines

12/22/2022

∙

by   Abuzer Yakaryılmaz, et al.

∙

0

∙

share

We show that bounded-error affine finite automata recognize uncountably many (and so some non-Turing recognizable) languages when using real-valued transitions.