Real-valued affine automata compute beyond Turing machines
Formal Languages and Automata Theory
2022-12-23 v1 Computational Complexity
Abstract
We show that bounded-error affine finite automata recognize uncountably many (and so some non-Turing recognizable) languages when using real-valued transitions.
Keywords
Cite
@article{arxiv.2212.11834,
title = {Real-valued affine automata compute beyond Turing machines},
author = {Abuzer Yakaryılmaz},
journal= {arXiv preprint arXiv:2212.11834},
year = {2022}
}
Comments
8 pages