作者: Anterior 時(shí)間: 2025-3-22 00:03 作者: 舉止粗野的人 時(shí)間: 2025-3-22 02:22 作者: sacrum 時(shí)間: 2025-3-22 08:36
Error and Predicativity and foundational errors. The suggestion is that ideas originating in the predicativity debate as a reply to foundational errors are now having profound influence to the way we try to address the issue of local errors. Here fundamental new interactions between computer science and mathematics emerge.作者: 傳染 時(shí)間: 2025-3-22 10:18 作者: achlorhydria 時(shí)間: 2025-3-22 13:55
New Bounds on Optimal Sorting Networks Furthermore, we show that our sorting network for . inputs is optimal in the sense that no sorting network using less layers exists. This solves the main open problem of [D.?Bundala & J.?Závodny. Optimal sorting networks, Proc. LATA 2014].作者: achlorhydria 時(shí)間: 2025-3-22 18:05
Conference proceedings 20152015..The 26 revised papers presented were carefully reviewed and selected from 64 submissions and included together with 10 invited papers in this proceedings. The conference CiE 2015 has six special sessions: two sessions, Representing Streams and Reverse Mathematics, were introduced for the first作者: 形容詞詞尾 時(shí)間: 2025-3-22 21:21
0302-9743 E conference series were addressed in the further special sessions on Automata, Logic and Infinite Games; Bio-inspired Computation; Classical Computability Theory; as well as History and Philosophy of Computing..978-3-319-20027-9978-3-319-20028-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 去掉 時(shí)間: 2025-3-23 03:47 作者: bronchodilator 時(shí)間: 2025-3-23 08:58 作者: 良心 時(shí)間: 2025-3-23 13:11
https://doi.org/10.1007/978-94-6209-230-3 and foundational errors. The suggestion is that ideas originating in the predicativity debate as a reply to foundational errors are now having profound influence to the way we try to address the issue of local errors. Here fundamental new interactions between computer science and mathematics emerge.作者: 圖表證明 時(shí)間: 2025-3-23 15:55
,The Genre ‘Fairy Tale’ and its Research,ns in [.]. Here, we start exploring another analogue concerning recognizability rather than computability. We show that, for Infinite Time Register Machines (.s), if a real . is recognizable relative to all elements of a non-meager Borel set ., then . is recognizable.作者: 壓艙物 時(shí)間: 2025-3-23 20:36
Gothic Transgression, Horror and Film, Furthermore, we show that our sorting network for . inputs is optimal in the sense that no sorting network using less layers exists. This solves the main open problem of [D.?Bundala & J.?Závodny. Optimal sorting networks, Proc. LATA 2014].作者: 放肆的我 時(shí)間: 2025-3-23 23:09 作者: 萬靈丹 時(shí)間: 2025-3-24 04:05 作者: Initiative 時(shí)間: 2025-3-24 06:58
Covering the Recursive Sets not i.o. subuniform. This shows that there are examples of classes that cannot be covered with methods other than probabilistic ones. It is easily seen that every set of hyperimmune degree can cover the recursive sets. We prove that there are both examples of hyperimmune-free degree that can and that cannot compute such a cover.作者: 極大痛苦 時(shí)間: 2025-3-24 12:57
Degrees of Unsolvability: A Tutorialms of finite type. We describe how the category of sheaves over . forms a model of intuitionistic mathematics, known as the .. This model is a rigorous implementation of Kolmogorov’s nonrigorous 1932 interpretation of intuitionism as a “calculus of problems”.作者: SCORE 時(shí)間: 2025-3-24 15:21
Conference proceedings 2015 time in the conference series. In addition to this, new developments in areas frequently covered in the CiE conference series were addressed in the further special sessions on Automata, Logic and Infinite Games; Bio-inspired Computation; Classical Computability Theory; as well as History and Philosophy of Computing..作者: 外科醫(yī)生 時(shí)間: 2025-3-24 23:01
978-3-319-20027-9Springer International Publishing Switzerland 2015作者: alleviate 時(shí)間: 2025-3-25 02:13
Evolving Computability978-3-319-20028-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 滔滔不絕的人 時(shí)間: 2025-3-25 06:42 作者: 優(yōu)雅 時(shí)間: 2025-3-25 09:48
https://doi.org/10.1007/978-94-6209-230-3ints as highlighting different levels of understanding in mathematics. A connection is made with two kinds of error which appear in mathematics: local and foundational errors. The suggestion is that ideas originating in the predicativity debate as a reply to foundational errors are now having profou作者: 反叛者 時(shí)間: 2025-3-25 14:38 作者: 柔軟 時(shí)間: 2025-3-25 16:38
Tiago Geraldo,Nuno Igreja Matosod and some machine computation. We also obtain exact expressions for the recurrence and appearance function of the paperfolding sequences, and solve an open problem of Rampersad about factors shared in common between two different paperfolding sequences.作者: 集合 時(shí)間: 2025-3-25 22:31
Fairness in International TradeMiller as well as new direct constructions using martingales..At the same time, we introduce the concept of i.o. subuniformity and relate this concept to recursive measure theory. We prove that there are classes closed downwards under Turing reducibility that have recursive measure zero and that are作者: 遺棄 時(shí)間: 2025-3-26 01:21
Minas Dimitriou,Gottfried Schweiger forward difference operator. An extension of this formula to functions from . to . was given in 2008 by P. Silva and the author. In this paper, the formula is further extended to functions from . into the free group over ..作者: Myocarditis 時(shí)間: 2025-3-26 04:56
Fairness und Vertrauen in der Finanzberatungn two degree structures: the semilattice of Turing degrees, ., and its completion, ., the lattice of Muchnik degrees. We emphasize specific, natural degrees and their relationship to reverse mathematics. We show how Muchnik degrees can be used to classify tiling problems and symbolic dynamical syste作者: 協(xié)定 時(shí)間: 2025-3-26 10:29
Whatever Happened to Dominant Discourse?,ts that deal explicitly with this problem and that aim to optimize the obtained construction. A particular attention is given to models based on the splicing operation as well as to multiset-rewriting based models.作者: 輕率的你 時(shí)間: 2025-3-26 15:01 作者: 裂縫 時(shí)間: 2025-3-26 17:17
,The Genre ‘Fairy Tale’ and its Research,he analogous statement for non-meagerness instead of positive Lebesgue measure - has been shown to carry over to many models of transfinite computations in [.]. Here, we start exploring another analogue concerning recognizability rather than computability. We show that, for Infinite Time Register Ma作者: 職業(yè)拳擊手 時(shí)間: 2025-3-26 22:34 作者: Abnormal 時(shí)間: 2025-3-27 01:45
https://doi.org/10.1057/9781137342409those given by the hierarchies of qcb.-spaces introduced in [., .] and provide new tools to investigate non-countably based qcb.-spaces. As a by-product, we show that there is no universal qcb.-space and establish several apparently new properties of the Kleene-Kreisel continuous functionals of coun作者: 埋葬 時(shí)間: 2025-3-27 06:23 作者: 辯論 時(shí)間: 2025-3-27 12:45
Compensation According to Integration,After briefly mentioning the motivation and the “dreams” of unconventional computing (with an eye on natural computing, especially on bio-inspired computing), we ask ourselves whether these “dreams” are realistic, and end with a couple of related research issues from the membrane computing area.作者: 拱形大橋 時(shí)間: 2025-3-27 17:09
Postmodern Revisions: New Tales for Old?,We build a decidable structure . such that . is a prime model of the theory . and . has no degree of autostability relative to strong constructivizations.作者: EVEN 時(shí)間: 2025-3-27 18:44 作者: Control-Group 時(shí)間: 2025-3-27 23:49 作者: 柱廊 時(shí)間: 2025-3-28 02:39
Prime Model with No Degree of Autostability Relative to Strong ConstructivizationsWe build a decidable structure . such that . is a prime model of the theory . and . has no degree of autostability relative to strong constructivizations.作者: NEG 時(shí)間: 2025-3-28 07:45 作者: 機(jī)械 時(shí)間: 2025-3-28 11:49 作者: laxative 時(shí)間: 2025-3-28 15:43
Minas Dimitriou,Gottfried Schweiger forward difference operator. An extension of this formula to functions from . to . was given in 2008 by P. Silva and the author. In this paper, the formula is further extended to functions from . into the free group over ..作者: 來這真柔軟 時(shí)間: 2025-3-28 19:10
Whatever Happened to Dominant Discourse?,ts that deal explicitly with this problem and that aim to optimize the obtained construction. A particular attention is given to models based on the splicing operation as well as to multiset-rewriting based models.作者: overshadow 時(shí)間: 2025-3-28 23:56 作者: Aggrandize 時(shí)間: 2025-3-29 04:55 作者: 松軟 時(shí)間: 2025-3-29 08:23
A New Approach to the Paperfolding Sequencesod and some machine computation. We also obtain exact expressions for the recurrence and appearance function of the paperfolding sequences, and solve an open problem of Rampersad about factors shared in common between two different paperfolding sequences.作者: 烤架 時(shí)間: 2025-3-29 12:36 作者: PURG 時(shí)間: 2025-3-29 16:14
Universality in Molecular and Cellular Computingts that deal explicitly with this problem and that aim to optimize the obtained construction. A particular attention is given to models based on the splicing operation as well as to multiset-rewriting based models.作者: 棲息地 時(shí)間: 2025-3-29 20:41 作者: jocular 時(shí)間: 2025-3-30 03:49 作者: 令人悲傷 時(shí)間: 2025-3-30 04:34
https://doi.org/10.1007/978-3-319-20028-6Analog computation; Bioinformatics and bio-inspired computation; Classical computability and degree st作者: commune 時(shí)間: 2025-3-30 10:22
Arnold Beckmann,Victor Mitrana,Mariya SoskovaIncludes supplementary material: 作者: expunge 時(shí)間: 2025-3-30 12:45 作者: coddle 時(shí)間: 2025-3-30 18:26
Computers and the Mechanics of Communicationptual relevance of this new field of application of computers has been advocated by Carl Adam Petri (1926–2010) and Anatol W. Holt (1927–2010), two computer scientists best known for their contributions to the subject of ., a graphical formalism for describing the causal dependence of events in syst作者: Aggrandize 時(shí)間: 2025-3-30 22:06 作者: 信徒 時(shí)間: 2025-3-31 00:52 作者: bifurcate 時(shí)間: 2025-3-31 07:07 作者: 換話題 時(shí)間: 2025-3-31 11:27
Covering the Recursive SetsMiller as well as new direct constructions using martingales..At the same time, we introduce the concept of i.o. subuniformity and relate this concept to recursive measure theory. We prove that there are classes closed downwards under Turing reducibility that have recursive measure zero and that are作者: instulate 時(shí)間: 2025-3-31 14:08
Newton’s Forward Difference Equation for Functions from Words to Words forward difference operator. An extension of this formula to functions from . to . was given in 2008 by P. Silva and the author. In this paper, the formula is further extended to functions from . into the free group over ..作者: 不能平靜 時(shí)間: 2025-3-31 17:38 作者: 宣傳 時(shí)間: 2025-3-31 23:57 作者: 基因組 時(shí)間: 2025-4-1 01:58
Some Results on Interactive Proofs for Real Computationsizes the class IP as PSPACE or, equivalently, as PAT and PAR in the Turing model. Since space resources alone are known not to make much sense in real number computations the question arises whether IP can be similarly characterized by one of the latter classes. Ivanov and de Rougemont [.] started t作者: 路標(biāo) 時(shí)間: 2025-4-1 07:17
-Recognizability from Random Oracleshe analogous statement for non-meagerness instead of positive Lebesgue measure - has been shown to carry over to many models of transfinite computations in [.]. Here, we start exploring another analogue concerning recognizability rather than computability. We show that, for Infinite Time Register Ma
