加载中…
2014-02-05
A note on Autoreducibility for Infinite Time Register Machines and parameter-free Ordinal Turing Machines
Merlin Carl
文献摘要
We propose a notion of autoreducibility for infinite time computability and explore it and its connection with a notion of randomness for infinite time machines.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本