Real-valued affine automata compute beyond Turing machines
arxiv（2022）
摘要
We show that bounded-error affine finite automata recognize uncountably many (and so some non-Turing recognizable) languages when using real-valued transitions.
更多查看译文
关键词
affine automata compute,turing,real-valued
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要