植物群
发表于 2025-3-28 18:09:41
http://reply.papertrans.cn/24/2349/234825/234825_41.png
groggy
发表于 2025-3-28 22:34:44
http://reply.papertrans.cn/24/2349/234825/234825_42.png
文艺
发表于 2025-3-28 23:16:18
Higher Type Recursion for Transfinite Machine Theory,We look at some preliminary work in the theory of transfinite Turing machines generalised in the manner of Kleene to higher type recursion theory. The underlying philosophy is that ordinary Turing computability and inductive definability is replaced by the example here of Infinite Time Turing Machine computability and quasi-inductive definability.
很是迷惑
发表于 2025-3-29 05:21:24
Study of Stepwise Simulation Between ASM,In this paper we study the notion of stepwise simulation between Abstract State Machines, to explore if some natural change on the original definition would keep it sound. We prove that we have to keep the classical notion and give results about the computability of the simulation itself.
争吵
发表于 2025-3-29 09:22:53
http://reply.papertrans.cn/24/2349/234825/234825_45.png
沙发
发表于 2025-3-29 14:00:20
http://reply.papertrans.cn/24/2349/234825/234825_46.png
相一致
发表于 2025-3-29 17:18:52
http://reply.papertrans.cn/24/2349/234825/234825_47.png
周年纪念日
发表于 2025-3-29 23:07:38
Julien Bourgeois,Wolfgang Minkerto a transfinite model of computability by allowing them to run for a transfinite amount of time. The model of Koepke and Seyfferth is asymmetric in the following sense: while their machines can run for a transfinite number of steps, they use real numbers rather than their transfinite analogues. In
一再烦扰
发表于 2025-3-30 01:43:53
http://reply.papertrans.cn/24/2349/234825/234825_49.png
UNT
发表于 2025-3-30 06:17:21
http://reply.papertrans.cn/24/2349/234825/234825_50.png