加载中…
We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the class of Set Recursive functions coincide.

生成讲解博客的中文版本

生成AI智能校验的中文版本