必死
发表于 2025-3-30 11:39:40
http://reply.papertrans.cn/19/1854/185336/185336_51.png
HATCH
发表于 2025-3-30 12:44:12
https://doi.org/10.1007/978-3-658-23432-4 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.
glacial
发表于 2025-3-30 17:05:55
Mascha van de Kuit,Dirk de Natriset 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.
SPASM
发表于 2025-3-30 21:49:35
http://reply.papertrans.cn/19/1854/185336/185336_54.png
统治人类
发表于 2025-3-31 04:28:19
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-31 06:51:44
http://reply.papertrans.cn/19/1854/185336/185336_56.png
Dealing
发表于 2025-3-31 11:05:15
On the Complexity of Conversion Between Classic Real Number Representations,sequences), it is in general not possible to do so subrecursively: conversions in general need to perform unbounded search. This raises the question of categorizing the pairs of representations between which either subrecursive conversion is possible, or is not possible..The purpose of this paper is
Deduct
发表于 2025-3-31 16:29:24
http://reply.papertrans.cn/19/1854/185336/185336_58.png
tinnitus
发表于 2025-3-31 17:51:28
http://reply.papertrans.cn/19/1854/185336/185336_59.png
Consensus
发表于 2025-4-1 01:25:56
http://reply.papertrans.cn/19/1854/185336/185336_60.png