arXiv Open Access 2022

Real-valued affine automata compute beyond Turing machines

Abuzer Yakaryılmaz

Lihat Sumber

Abstrak

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

Topik & Kata Kunci

cs.FL cs.CC

Penulis (1)

Abuzer Yakaryılmaz

Format Sitasi

APA MLA BibTeX

Yakaryılmaz, A. (2022). Real-valued affine automata compute beyond Turing machines. https://arxiv.org/abs/2212.11834

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓