標(biāo)題: Titlebook: Beyond the Horizon of Computability; 16th Conference on C Marcella Anselmo,Gianluca Della Vedova,Arno Pauly Conference proceedings 2020 Spr [打印本頁] 作者: 年邁 時(shí)間: 2025-3-21 16:24
書目名稱Beyond the Horizon of Computability影響因子(影響力)
書目名稱Beyond the Horizon of Computability影響因子(影響力)學(xué)科排名
書目名稱Beyond the Horizon of Computability網(wǎng)絡(luò)公開度
書目名稱Beyond the Horizon of Computability網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Beyond the Horizon of Computability被引頻次
書目名稱Beyond the Horizon of Computability被引頻次學(xué)科排名
書目名稱Beyond the Horizon of Computability年度引用
書目名稱Beyond the Horizon of Computability年度引用學(xué)科排名
書目名稱Beyond the Horizon of Computability讀者反饋
書目名稱Beyond the Horizon of Computability讀者反饋學(xué)科排名
作者: 不能約 時(shí)間: 2025-3-21 20:28 作者: 細(xì)查 時(shí)間: 2025-3-22 00:43
Interne Kommunikation in agilen Unternehmengly, 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 ..作者: Stricture 時(shí)間: 2025-3-22 04:36
https://doi.org/10.1007/978-3-658-24552-8 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 [.].作者: Campaign 時(shí)間: 2025-3-22 10:41 作者: Glycogen 時(shí)間: 2025-3-22 14:04
https://doi.org/10.1007/978-3-658-23432-4In the framework of finite-type arithmetic, we characterize the notion that an existence statement is primitive recursive Weihrauch reducible to the parallelization of another existence statement by a standard derivability notion in constructive reverse mathematics.作者: 正論 時(shí)間: 2025-3-22 19:33
https://doi.org/10.1007/978-3-658-23432-4We introduce two essentially undecidable first-order theories . and .. The intended model for the theories is a term model. We prove that . is mutually interpretable with Robinson’s .. Moreover, we prove that Robinson’s . is interpretable in ..作者: 合唱團(tuán) 時(shí)間: 2025-3-23 00:49
https://doi.org/10.1007/978-3-531-91819-8Suppose we are given a collection of mathematical objects such as the class of connected compact Polish groups or the set of all real numbers which are normal to some base.作者: 我說不重要 時(shí)間: 2025-3-23 01:29 作者: 表臉 時(shí)間: 2025-3-23 06:56
Methodische Konzeption der Untersuchung,There are continuum many homeomorphism types of Polish spaces. In particular, there is a Polish space which is not homeomorphic to any computably presented Polish space. We examine the details of degrees of non-computability of presenting homeomorphic copies of Polish spaces.作者: Phonophobia 時(shí)間: 2025-3-23 13:41
Some Notes on Spaces of Ideals and Computable Topology,It was shown in [.] that the . introduced in [.] can be equivalently characterized as spaces of ideals in the following sense.作者: 不舒服 時(shí)間: 2025-3-23 14:59 作者: septicemia 時(shí)間: 2025-3-23 18:39 作者: 簡略 時(shí)間: 2025-3-24 01:25
Computable Analysis and Classification Problems,Suppose we are given a collection of mathematical objects such as the class of connected compact Polish groups or the set of all real numbers which are normal to some base.作者: Pathogen 時(shí)間: 2025-3-24 03:48
On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and RecursivThe present paper surveys some results from the inductive inference of recursive functions, which are related to the characterization of inferrible function classes in terms of complexity theory, and in terms of recursive numberings. Some new results and open problems are also included.作者: elucidate 時(shí)間: 2025-3-24 08:13
Degrees of Non-computability of Homeomorphism Types of Polish Spaces,There are continuum many homeomorphism types of Polish spaces. In particular, there is a Polish space which is not homeomorphic to any computably presented Polish space. We examine the details of degrees of non-computability of presenting homeomorphic copies of Polish spaces.作者: Arroyo 時(shí)間: 2025-3-24 12:44 作者: 他很靈活 時(shí)間: 2025-3-24 18:28 作者: 斗爭 時(shí)間: 2025-3-24 21:00
https://doi.org/10.1007/978-3-658-23432-4sequences), 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作者: AVID 時(shí)間: 2025-3-25 01:34 作者: ARY 時(shí)間: 2025-3-25 06:04 作者: 商店街 時(shí)間: 2025-3-25 08:02 作者: apiary 時(shí)間: 2025-3-25 13:44
https://doi.org/10.1007/978-3-658-22982-5e SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate for an expressive subclass of NP that exhibits a complexity dichotomy. We show that ASNP has a complexity dichotomy if and only if the infinite-domain dichotomy conjecture holds for constraint satisfaction problems for first-作者: Pamphlet 時(shí)間: 2025-3-25 17:13
Interne Kunden-Lieferanten-Beziehungenbtracting one from the end result. Such sequences always reach zero, but this fact is unprovable in Peano arithmetic. In this paper we instead consider notations for natural numbers based on the Ackermann function. We define two new Goodstein processes, obtaining new independence results for . and .作者: Infant 時(shí)間: 2025-3-25 23:38 作者: configuration 時(shí)間: 2025-3-26 02:24
Zusammenfassung und Implikationen,tic winning strategies, one may ask how simple such strategies can get. The answer may help with actual implementation, or to win despite imperfect information, or to conceal sensitive information especially if the game is repeated..Given a concurrent two-player win/lose game of infinite duration, t作者: AMOR 時(shí)間: 2025-3-26 07:04
https://doi.org/10.1007/978-3-8350-9101-6gers as bit strings, and vice versa. For such discrete data, the actual encoding is usually straightforward and/or complexity-theoretically inessential (up?to polynomial time, say); but concerning continuous data, already real numbers naturally suggest various encodings with very different computati作者: Nutrient 時(shí)間: 2025-3-26 11:18 作者: TEN 時(shí)間: 2025-3-26 16:12 作者: persistence 時(shí)間: 2025-3-26 18:39
978-3-030-51465-5Springer Nature Switzerland AG 2020作者: poliosis 時(shí)間: 2025-3-26 21:35
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 ..作者: 無目標(biāo) 時(shí)間: 2025-3-27 01:31
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 [.].作者: 游行 時(shí)間: 2025-3-27 07:42 作者: 圣人 時(shí)間: 2025-3-27 12:37 作者: 頌揚(yáng)國家 時(shí)間: 2025-3-27 16:12
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 時(shí)間: 2025-3-27 18:28 作者: creditor 時(shí)間: 2025-3-27 23:55
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 時(shí)間: 2025-3-28 03:07
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 時(shí)間: 2025-3-28 09:25
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.作者: 過濾 時(shí)間: 2025-3-28 13:19 作者: 帳單 時(shí)間: 2025-3-28 18:25
https://doi.org/10.1007/978-3-8350-9101-6ently, notions and results from the general theory of Bishop spaces are naturally translated to the study of Baire class one-functions. We work within Bishop’s informal system of constructive mathematics ., that is . extended with inductive definitions with rules of countably many premises.作者: Pelvic-Floor 時(shí)間: 2025-3-28 20:56 作者: dithiolethione 時(shí)間: 2025-3-29 02:02
Conference proceedings 2020ring June 29 until July 3, 2020. The conference moved to a virtual format due to the coronavirus pandemic.?.The 30 full and 5 short papers presented in this volume were carefully reviewed and selected from 72 submissions. CiE promotes the development of computability-related?science, ranging over ma作者: 別炫耀 時(shí)間: 2025-3-29 06:08
Conference proceedings 2020 as philosophy and history of computing. CiE 2020 had as?its motto Beyond the Horizon of Computability, reflecting the interest of CiE in?research transgressing the traditional boundaries of computability theory..作者: 鎮(zhèn)壓 時(shí)間: 2025-3-29 07:42 作者: 脊椎動(dòng)物 時(shí)間: 2025-3-29 12:56
https://doi.org/10.1007/978-3-531-91819-8nded devices, proving the existence of a proper infinite nonregular language hierarchy depending on the sweep complexity both in the deterministic and nondeterministic case. Also, we show that the nondeterministic devices are always more powerful than their deterministic variant if at least a logarithmic number of sweeps is?given.作者: 可用 時(shí)間: 2025-3-29 18:47
https://doi.org/10.1007/978-3-658-22982-5be evaluated in polynomial time on classes of finite structures of bounded treewidth. We show that the syntax of ASNP is decidable. The proof relies on the fact that for classes of finite binary structures given by finitely many forbidden substructures, the amalgamation property is decidable.作者: boisterous 時(shí)間: 2025-3-29 22:09 作者: 樹木心 時(shí)間: 2025-3-30 00:51
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Desnded devices, proving the existence of a proper infinite nonregular language hierarchy depending on the sweep complexity both in the deterministic and nondeterministic case. Also, we show that the nondeterministic devices are always more powerful than their deterministic variant if at least a logarithmic number of sweeps is?given.作者: stress-test 時(shí)間: 2025-3-30 04:53
ASNP: A Tame Fragment of Existential Second-Order Logic,be evaluated in polynomial time on classes of finite structures of bounded treewidth. We show that the syntax of ASNP is decidable. The proof relies on the fact that for classes of finite binary structures given by finitely many forbidden substructures, the amalgamation property is decidable.作者: 必死 時(shí)間: 2025-3-30 11:39 作者: HATCH 時(shí)間: 2025-3-30 12:44
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 時(shí)間: 2025-3-30 17:05
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 時(shí)間: 2025-3-30 21:49 作者: 統(tǒng)治人類 時(shí)間: 2025-3-31 04:28
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 ..作者: 文件夾 時(shí)間: 2025-3-31 06:51 作者: Dealing 時(shí)間: 2025-3-31 11:05
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 時(shí)間: 2025-3-31 16:29 作者: tinnitus 時(shí)間: 2025-3-31 17:51 作者: Consensus 時(shí)間: 2025-4-1 01:25 作者: committed 時(shí)間: 2025-4-1 02:20
ASNP: A Tame Fragment of Existential Second-Order Logic,e SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate for an expressive subclass of NP that exhibits a complexity dichotomy. We show that ASNP has a complexity dichotomy if and only if the infinite-domain dichotomy conjecture holds for constraint satisfaction problems for first-作者: Endometrium 時(shí)間: 2025-4-1 06:02
