poliosis 发表于 2025-3-26 21:35:23

A Note on Computable Embeddings for Ordinals and Their Reverses,gly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree structure. Our main result shows that although . is computably embeddable in ., the class . is . computably embeddable in . for any natural number ..

无目标 发表于 2025-3-27 01:31:48

Clockability for Ordinal Turing Machines, be OTM-clockable, that .-admissible ordinals are never OTM-clockable and that gaps in the OTM-clockable ordinals are always started by admissible limits of admissible ordinals. This partially answers two questions in [.].

游行 发表于 2025-3-27 07:42:19

http://reply.papertrans.cn/19/1854/185336/185336_33.png

圣人 发表于 2025-3-27 12:37:35

http://reply.papertrans.cn/19/1854/185336/185336_34.png

颂扬国家 发表于 2025-3-27 16:12:05

Interne Kunden-Lieferanten-Beziehungenr notations for natural numbers based on the Ackermann function. We define two new Goodstein processes, obtaining new independence results for . and ., theories of second order arithmetic related to the existence of Turing jumps.

Expostulate 发表于 2025-3-27 18:28:22

http://reply.papertrans.cn/19/1854/185336/185336_36.png

creditor 发表于 2025-3-27 23:55:26

Ackermannian Goodstein Sequences of Intermediate Growth,r notations for natural numbers based on the Ackermann function. We define two new Goodstein processes, obtaining new independence results for . and ., theories of second order arithmetic related to the existence of Turing jumps.

ELATE 发表于 2025-3-28 03:07:15

On the Complexity of Conversion Between Classic Real Number Representations, to prove the following positive result: for a number of well-known representations (Beatty sequences, Dedekind cuts, General base expansions, Hurwitz characteristics, and Locators) conversion between the representations can be performed effectively and with good subrecursive bounds.

Agility 发表于 2025-3-28 09:25:18

Non-coding Enumeration Operators,et of polynomials realizing Hilbert’s Tenth Problem in the ring .; and the ., mapping the atomic diagram of an algebraic field . of characteristic 0 to the set of polynomials in . with roots in .. These lead to new open questions about enumeration operators in general.

过滤 发表于 2025-3-28 13:19:06

http://reply.papertrans.cn/19/1854/185336/185336_40.png
页: 1 2 3 [4] 5 6 7
查看完整版本: Titlebook: Beyond the Horizon of Computability; 16th Conference on C Marcella Anselmo,Gianluca Della Vedova,Arno Pauly Conference proceedings 2020 Spr