步履蹒跚 发表于 2025-3-26 22:28:49

http://reply.papertrans.cn/24/2357/235613/235613_31.png

jagged 发表于 2025-3-27 02:25:47

http://reply.papertrans.cn/24/2357/235613/235613_32.png

STENT 发表于 2025-3-27 07:19:31

http://reply.papertrans.cn/24/2357/235613/235613_33.png

MOAN 发表于 2025-3-27 09:45:58

Learning Languages with Decidable Hypotheses,ip problem is undecidable. In this paper, we use a different system which allows for naming arbitrary decidable languages, namely . (called .-indices). These indices have the drawback that it is now not decidable whether a given hypothesis is even a legal .-index..In this first analysis of learning

Muffle 发表于 2025-3-27 13:50:26

http://reply.papertrans.cn/24/2357/235613/235613_35.png

1分开 发表于 2025-3-27 19:03:45

http://reply.papertrans.cn/24/2357/235613/235613_36.png

Ventricle 发表于 2025-3-27 23:16:40

http://reply.papertrans.cn/24/2357/235613/235613_37.png

地壳 发表于 2025-3-28 05:32:41

The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines,ticular, we show that the lost melody theorem (originally proved for ITTMs by Hamkins and Lewis), i.e. the existence of non-computable, but recognizable real numbers, holds for ITBMs, that ITBM-recognizable real numbers are hyperarithmetic and that both ITBM-recognizable and ITBM-unrecognizable real

任命 发表于 2025-3-28 08:33:02

Randomising Realizability,sed computability with positive probability. In particular, we show that (i) the set of randomly realizable statements is closed under intuitionistic first-order logic, but (ii) different from the set of realizable statements, that (iii) “realizability with probability 1” is the same as realizabilit

分离 发表于 2025-3-28 11:52:24

http://reply.papertrans.cn/24/2357/235613/235613_40.png
页: 1 2 3 [4] 5 6
查看完整版本: Titlebook: Connecting with Computability; 17th Conference on C Liesbeth De Mol,Andreas Weiermann,David Fernández- Conference proceedings 2021 Springer