標(biāo)題: Titlebook: Computation, Physics and Beyond; International Worksh Michael J. Dinneen,Bakhadyr Khoussainov,André Nies Book 2012 Springer-Verlag GmbH Ber [打印本頁(yè)] 作者: Cataplexy 時(shí)間: 2025-3-21 16:50
書目名稱Computation, Physics and Beyond影響因子(影響力)
書目名稱Computation, Physics and Beyond影響因子(影響力)學(xué)科排名
書目名稱Computation, Physics and Beyond網(wǎng)絡(luò)公開(kāi)度
書目名稱Computation, Physics and Beyond網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Computation, Physics and Beyond被引頻次
書目名稱Computation, Physics and Beyond被引頻次學(xué)科排名
書目名稱Computation, Physics and Beyond年度引用
書目名稱Computation, Physics and Beyond年度引用學(xué)科排名
書目名稱Computation, Physics and Beyond讀者反饋
書目名稱Computation, Physics and Beyond讀者反饋學(xué)科排名
作者: aspect 時(shí)間: 2025-3-21 23:02 作者: Mitigate 時(shí)間: 2025-3-22 03:36
Springer Monographs in Mathematicsort by extending some of the well known results for plain and prefix-free complexities to the general case of Blum universal static complexity. We also extend some results obtained by Calude in [9] to a larger class of computable measures, proving that transducer complexity is a dual (Blum static) complexity measure.作者: MODE 時(shí)間: 2025-3-22 05:51 作者: Ancillary 時(shí)間: 2025-3-22 10:29
Strong Interactions in Low Dimensionsnction called . Its existence was proved by the author in 1981, but all attempts to find an explicit formula for it so far failed..In this note I consider the question whether this function is computable in the sense of constructive mathematics, and discuss some arguments suggesting that the answer might be negative.作者: Apoptosis 時(shí)間: 2025-3-22 12:57
Calude as Father of One of the Computer Science Journalst is also one of the few truly open access journals in computer science: both publication and access is free for everyone. In this paper we describe how the journal started, what problems it was confronted with, and how they were solved.作者: Apoptosis 時(shí)間: 2025-3-22 20:41
A Note on Blum Static Complexity Measuresort by extending some of the well known results for plain and prefix-free complexities to the general case of Blum universal static complexity. We also extend some results obtained by Calude in [9] to a larger class of computable measures, proving that transducer complexity is a dual (Blum static) complexity measure.作者: 膝蓋 時(shí)間: 2025-3-22 21:58 作者: 調(diào)情 時(shí)間: 2025-3-23 02:24 作者: 除草劑 時(shí)間: 2025-3-23 06:09
The Art of Reaching the Age of Sixtyishments. The key words here are interaction and impact. Through the glasses of this philosophy, I will try to contemplate the personality of Professor Cristian S. Calude as a scholar and as a person.作者: 構(gòu)想 時(shí)間: 2025-3-23 10:14
Random Semicomputable Reals Revisiteds in an elementary way, in particular requiring only basic knowledge of algorithmic randomness. We add also several simple observations relating lower semicomputable random reals and busy beaver functions.作者: Narcissist 時(shí)間: 2025-3-23 17:00 作者: 付出 時(shí)間: 2025-3-23 18:51 作者: 玉米 時(shí)間: 2025-3-24 00:55 作者: TRUST 時(shí)間: 2025-3-24 05:18
Computer Runtimes and the Length of Proofsested that theorem provers are subject to the same non-linear tradeoff between time and size as computer programs are, affording the possibility of determining optimal timeouts and waiting times in automatic theorem proving. I provide the statistics for some small choices of parameters for both of these systems.作者: 審問(wèn) 時(shí)間: 2025-3-24 09:06 作者: 吹牛大王 時(shí)間: 2025-3-24 11:30 作者: Foolproof 時(shí)間: 2025-3-24 17:44 作者: MITE 時(shí)間: 2025-3-24 19:07 作者: 去才蔑視 時(shí)間: 2025-3-25 01:34
Luttinger liquids: the basic concepts,mechanical interpretation of algorithmic information theory. We demonstrate the power of the elaboration by revealing a critical phenomenon, i.e., a phase transition, in the statistical mechanical interpretation, which cannot be captured by the original notion of weak truth-table reducibility.作者: 嘮叨 時(shí)間: 2025-3-25 07:08 作者: Definitive 時(shí)間: 2025-3-25 08:01
Dynamic correlations in quantum magnets,e countable cardinal, i.e. the cardinal of ?), or . (the cardinal of ?). We will see that for these “transfinite devices” almost all G?del’s limitations results have relatively simple generalisations.作者: Priapism 時(shí)間: 2025-3-25 15:09
Some Transfinite Generalisations of G?del’s Incompleteness Theoreme countable cardinal, i.e. the cardinal of ?), or . (the cardinal of ?). We will see that for these “transfinite devices” almost all G?del’s limitations results have relatively simple generalisations.作者: 不自然 時(shí)間: 2025-3-25 18:42
J. S. Meyer,V. I. Fal’ko,B. L. Altshuler, the relevant information can be packed in a very economical way, which leads to a tighter relation between .(. : .) and .(. : .) than the one provided in the classical symmetry-of-information theorem of Kolmogorov and Levin. We give here a simpler proof of this result.作者: 表皮 時(shí)間: 2025-3-25 23:33
Symmetry of Information: A Closer Look, the relevant information can be packed in a very economical way, which leads to a tighter relation between .(. : .) and .(. : .) than the one provided in the classical symmetry-of-information theorem of Kolmogorov and Levin. We give here a simpler proof of this result.作者: 四溢 時(shí)間: 2025-3-26 02:48
Book 2012peakers and regular papers presented at the International Workshop on Theoretical Computer Science, WTCS 2012, held in Auckland, New Zealand, in February 2012. .Cristian Calude has made a significant contribution to research in computer science theory. Along with early work by Chaitin, Ku?era, Kurtz作者: attenuate 時(shí)間: 2025-3-26 07:45 作者: Femish 時(shí)間: 2025-3-26 08:31
Invariance and Universality of Complexity alone, a general invariance theorem is proved and sufficient conditions are stated for complexity to be computable. Next, universal functions are introduced, defined by pairing functions. It is shown that properties of the pairing functions, that is, of the joint encodings of functions and their in作者: 大罵 時(shí)間: 2025-3-26 14:34 作者: 斜谷 時(shí)間: 2025-3-26 20:13
0302-9743 , and unconventional models of computation. They have been organized into four parts. The first part consists of papers discussing his978-3-642-27653-8978-3-642-27654-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Reclaim 時(shí)間: 2025-3-27 00:05 作者: BRAVE 時(shí)間: 2025-3-27 01:16
Fundamentals of Topological Insulators, alone, a general invariance theorem is proved and sufficient conditions are stated for complexity to be computable. Next, universal functions are introduced, defined by pairing functions. It is shown that properties of the pairing functions, that is, of the joint encodings of functions and their in作者: 單色 時(shí)間: 2025-3-27 06:22
Constructing the Infimum of Two Projectionsn a constructive convergence proof for the algorithm, one must add some hypotheses such as Markov’s principle or the locatedness of a certain range; and that in the finite-dimensional case, the existence of both the infimum and the supremum of the two projections suffices for the convergence of the algorithm.作者: 起來(lái)了 時(shí)間: 2025-3-27 10:50
How Much Information Can There Be in a Real Number?lude and Dinneen attempting to compute Ω. Furthermore, we propose measuring human intellectual progress (not scientific progress) via the number of bits of Ω that can be determined at any given moment in time using the current mathematical theories.作者: 六個(gè)才偏離 時(shí)間: 2025-3-27 14:47 作者: anchor 時(shí)間: 2025-3-27 21:16 作者: macrophage 時(shí)間: 2025-3-27 23:45
Strong Interactions in Low DimensionsThe present paper generalises results by Tadaki?[12] and Calude et al.?[1] on oscillation-free partially random infinite strings. Moreover, it shows that oscillation-free partial Chaitin randomness can be separated from oscillation-free partial strong Martin-L?f randomness by .-definable sets of infinite strings.作者: fulcrum 時(shí)間: 2025-3-28 02:51
Bounded RandomnessWe introduce some new variations of the notions of being Martin-L?f random where the tests are all clopen sets. We explore how these randomness notions relate to classical randomness notions and to degrees of unsolvability.作者: 迅速成長(zhǎng) 時(shí)間: 2025-3-28 07:06
Hartmanis-Stearns Conjecture on Real Time and TranscendenceHartmanis-Stearns conjecture asserts that any number whose decimal expansion can be computed by a multitape Turing machine is either rational or transcendental. After half a century of active research by computer scientists and mathematicians the problem is still open but much more interesting than in 1965.作者: mechanical 時(shí)間: 2025-3-28 12:23 作者: FACT 時(shí)間: 2025-3-28 16:30 作者: 傻 時(shí)間: 2025-3-28 18:54
978-3-642-27653-8Springer-Verlag GmbH Berlin Heidelberg 2012作者: Aura231 時(shí)間: 2025-3-28 23:26 作者: 贊美者 時(shí)間: 2025-3-29 06:46 作者: misanthrope 時(shí)間: 2025-3-29 07:14
https://doi.org/10.1007/978-3-319-58826-1 and Slaman?[5]. This joint effort led to a full characterization of lower semicomputable random reals, both as those that can be expressed as a “Chaitin Omega” and those that are maximal for the Solovay reducibility. The original proofs were somewhat involved; in this paper, we present these result作者: thalamus 時(shí)間: 2025-3-29 12:20
https://doi.org/10.1007/978-3-319-58826-1n a constructive convergence proof for the algorithm, one must add some hypotheses such as Markov’s principle or the locatedness of a certain range; and that in the finite-dimensional case, the existence of both the infimum and the supremum of the two projections suffices for the convergence of the 作者: HEPA-filter 時(shí)間: 2025-3-29 18:25
Springer Monographs in Mathematicsexity measure is a generalization of Kolmogorov/Chaitin complexity, also known as algorithmic or static complexity. In this paper we continue this effort by extending some of the well known results for plain and prefix-free complexities to the general case of Blum universal static complexity. We als作者: Odyssey 時(shí)間: 2025-3-29 23:21 作者: 放氣 時(shí)間: 2025-3-30 00:22 作者: NATTY 時(shí)間: 2025-3-30 07:00 作者: 莊嚴(yán) 時(shí)間: 2025-3-30 11:19
Fundamentals of Topological Insulators,mputable functions, the existence of universal machines and the invariance under the choice of machine. Recently, the notion of descriptional complexity for finite-state computable functions has been introduced by Calude et al. For the latter theory, one cannot rely on the existence of universal mac作者: narcissism 時(shí)間: 2025-3-30 15:08
https://doi.org/10.1007/978-3-658-11811-2d in classical language, yield major algorithmic randomness notions. He proved several results connecting constructive analysis and randomness that were rediscovered only much later..We give an overview in mostly chronological order. We sketch a proof that Demuth’s notion of Denjoy sets (or reals) c作者: Audiometry 時(shí)間: 2025-3-30 16:58 作者: 個(gè)人長(zhǎng)篇演說(shuō) 時(shí)間: 2025-3-30 21:15
Dynamic correlations in quantum magnets, a first order formula on the integers and decides (after a finite number of computations and always with a right answer) whether this formula is true or false. There are also many other limitations of usual computing theory that can be seen as generalisations of G?del incompleteness theorem: for ex作者: hemorrhage 時(shí)間: 2025-3-31 03:59
Luttinger liquids: the basic concepts,ere a computable bound on the use function is explicitly specified. This elaboration enables us to deal with the notion of asymptotic behavior in a manner like in computational complexity theory, while staying in computability theory. We apply the elaboration to sets which appear in the statistical 作者: 開(kāi)始發(fā)作 時(shí)間: 2025-3-31 05:52 作者: 攤位 時(shí)間: 2025-3-31 11:25 作者: 一窩小鳥(niǎo) 時(shí)間: 2025-3-31 15:31 作者: 好忠告人 時(shí)間: 2025-3-31 19:12
Computation, Physics and Beyond978-3-642-27654-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 媽媽不開(kāi)心 時(shí)間: 2025-3-31 22:52 作者: Corral 時(shí)間: 2025-4-1 05:49
I. V. Lerner,B. L. Althsuler,T. Giamarchilude and Dinneen attempting to compute Ω. Furthermore, we propose measuring human intellectual progress (not scientific progress) via the number of bits of Ω that can be determined at any given moment in time using the current mathematical theories.作者: perjury 時(shí)間: 2025-4-1 07:15
Michael J. Dinneen,Bakhadyr Khoussainov,André NiesState-of-the-art research.Unique visibility.Includes invited lectures by eminent researchers in theoretical computer science作者: Enrage 時(shí)間: 2025-4-1 10:32
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/232070.jpg作者: 恩惠 時(shí)間: 2025-4-1 15:28
The Art of Reaching the Age of Sixtyple. Our identity is of a field type (like the identity of an atom given by its interactions with the other atoms), not of an entity type. As a corollary, the best assessment of our life achievements comes from the impact of our activity, particularly from the reaction of other people to our accompl作者: interpose 時(shí)間: 2025-4-1 19:24
Calude as Father of One of the Computer Science Journalshed refereed papers on the Internet, yet also provided a printed “archive” version of all papers published during a year after the end of that year. It is also one of the few truly open access journals in computer science: both publication and access is free for everyone. In this paper we describe h作者: 激怒某人 時(shí)間: 2025-4-2 00:14
