Titlebook: Beyond the Horizon of Computability; 16th Conference on C Marcella Anselmo,Gianluca Della Vedova,Arno Pauly Conference proceedings 2020 Spr

poliosis

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 ..

無目標

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 [.].

游行

圣人

頌揚國家

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

creditor

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

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

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.

過濾