加载中…
2022-12-22
Real-valued affine automata compute beyond Turing machines
Abuzer Yakaryılmaz
文献摘要
We show that bounded-error affine finite automata recognize uncountably many (and so some non-Turing recognizable) languages when using real-valued transitions.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本