標(biāo)題: Titlebook: Machines, Computations, and Universality; 4th International Co Maurice Margenstern Conference proceedings 2005 Springer-Verlag Berlin Heide [打印本頁] 作者: malcontented 時間: 2025-3-21 17:54
書目名稱Machines, Computations, and Universality影響因子(影響力)
書目名稱Machines, Computations, and Universality影響因子(影響力)學(xué)科排名
書目名稱Machines, Computations, and Universality網(wǎng)絡(luò)公開度
書目名稱Machines, Computations, and Universality網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Machines, Computations, and Universality被引頻次
書目名稱Machines, Computations, and Universality被引頻次學(xué)科排名
書目名稱Machines, Computations, and Universality年度引用
書目名稱Machines, Computations, and Universality年度引用學(xué)科排名
書目名稱Machines, Computations, and Universality讀者反饋
書目名稱Machines, Computations, and Universality讀者反饋學(xué)科排名
作者: 拍下盜公款 時間: 2025-3-21 23:15 作者: sphincter 時間: 2025-3-22 03:08
Is Bosco’s Rule Universal? companion paper we explore various questions which have arisen since Conway posed his challenge, including whether the details given in his proof that Life is universal are sufficient and what necessary and sufficient conditions are required to prove that Bosco’s rule, or any two-dimensional CA, is universal.作者: Inflamed 時間: 2025-3-22 07:29
Computational Completeness of P Systems with Active Membranes and Two Polarizationsrane, assigned to at most two membranes are shown to be computationally complete, which improves the previous result of this type with respect to the number of polarizations as well as to the number of membranes. Allowing a special variant . of rules of type . to delete symbols by sending them out, even only one membrane is enough.作者: Traumatic-Grief 時間: 2025-3-22 12:22 作者: fertilizer 時間: 2025-3-22 13:15 作者: Adherent 時間: 2025-3-22 17:08
Abstract Geometrical Computation for Black Hole Computationhe same property: it can simulate any Turing machine and can decide any . problem through the creation of an accumulation. Finitely many signals can leave any accumulation, and it can be known whether anything leaves. This corresponds to a black hole effect.作者: 大溝 時間: 2025-3-22 23:17
Register Complexity of LOOP -, WHILE -, and GOTO -Programsely) functions .:?. →?. (partial functions ., respectively) that is induced by the number of registers collapses to a fixed level. In all three cases the first levels are separated. Our results show that there exist universal .- and .-programs with a constant number of registers.作者: Goblet-Cells 時間: 2025-3-23 01:48 作者: 新義 時間: 2025-3-23 05:51 作者: conquer 時間: 2025-3-23 13:23 作者: CERE 時間: 2025-3-23 16:43 作者: 不理會 時間: 2025-3-23 18:25
Algorithmic Randomness, Quantum Physics, and Incompletenesss? Can quantum randomness be used to trespass the Turing’s barrier? Can complexity shed more light on incompleteness? In this paper we use variants of “algorithmic complexity” to discuss the above questions.作者: 吹氣 時間: 2025-3-23 22:47 作者: 過渡時期 時間: 2025-3-24 05:53
Universality and Cellular Automatamputational Equivalence”. We discuss a classification for cellular automata that is based on computably enumerable degrees. In this setting the full structure of the semilattice of the c.e. degrees is inherited by the cellular automata.作者: Congruous 時間: 2025-3-24 06:31 作者: overhaul 時間: 2025-3-24 11:30
Computational Completeness of P Systems with Active Membranes and Two Polarizationse membrane system, and of type . i.e., communication rules sending out an object of a membrane thereby possibly changing the polarization of this membrane, assigned to at most two membranes are shown to be computationally complete, which improves the previous result of this type with respect to the 作者: crumble 時間: 2025-3-24 16:02 作者: 原始 時間: 2025-3-24 21:38 作者: 盲信者 時間: 2025-3-25 00:00
Real Recursive Functions and Real Extensions of Recursive Functionsunctions containing some basic functions and closed by composition and linear integration..We extend this result to . computable functions: functions over the reals that extend total recursive functions over the integers are proved to correspond to the smallest class of real functions containing som作者: Aggressive 時間: 2025-3-25 04:46
Ordering and Convex Polyominoesies of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order. In particular we consider the families of polyominoes and convex polyominoes and the family, recently introduced by the authors, of L-convex polyominoes..In the first part of the paper we s作者: MANIA 時間: 2025-3-25 11:09 作者: 芭蕾舞女演員 時間: 2025-3-25 12:43 作者: 管理員 時間: 2025-3-25 19:29 作者: Alienated 時間: 2025-3-25 20:22 作者: 老巫婆 時間: 2025-3-26 00:23 作者: cylinder 時間: 2025-3-26 08:12
Sequential P Systems with Unit Rules and Energy Assigned to Membranesin the area of membrane systems) and, moreover, every membrane carries an energy value that can be changed during a computation by objects passing through the membrane. For the application of rules leading from one configuration of the system to the succeeding configuration we consider a sequential 作者: 粗鄙的人 時間: 2025-3-26 12:04
Hierarchies of DLOGTIME-Uniform Circuitsy a family of .-uniform circuits of depth?. and size . but not by any family of .-uniform circuits of depth?. and size?., where .>?0, .>0, ..>1, and ..≥1 are arbitrary rational constants. It is also shown that there is a language which can be recognized by a family of .-uniform circuits of depth?(1+作者: ELUC 時間: 2025-3-26 16:07
Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectd its 14-state implementation are given. It is shown that there exists a 14-state 2-D CA that can synchronize any . × . rectangular array in . + . + max(. + . , . + . – . – . + 2) – 4 steps with the general at an arbitrary initial position (., .),where 1 ≤ . ≤ ., 1 ≤ . ≤ .. The generalized linear-ti作者: photophobia 時間: 2025-3-26 18:28
Register Complexity of LOOP -, WHILE -, and GOTO -Programsunctions from the non-negative integers to the non-negative integers. It turns out that the hierarchy of .-computable (.-, and .-computable, respectively) functions .:?. →?. (partial functions ., respectively) that is induced by the number of registers collapses to a fixed level. In all three cases 作者: 預(yù)兆好 時間: 2025-3-26 23:48
componentwise nonnegative, while in CLP they are points in a pointed convex cone (see Appendix B.1) of an Euclidean space, such as vectors as well as matrices of finite dimensions. For example, Semidefinite programming (SDP) is a kind of CLP, where the variable points are symmetric matrices constra作者: 僵硬 時間: 2025-3-27 03:41 作者: 入伍儀式 時間: 2025-3-27 07:50
Alain Colmerauerhts for developing new results.Features end-of-chapter exerc.The 5th edition of this classic textbook covers the central concepts of practical optimization techniques, with an emphasis on methods that are both state-of-the-art and popular. One major insight is the connection between the purely analy作者: 堅毅 時間: 2025-3-27 12:11
Juhani Karhum?kipters that consider such problems roughly correspond to the following classification scheme. Consider a constrained minimization problem having . variables and . constraints. Methods can be devised for solving this problem that work in spaces of dimension .???., ., ., or .?+?.. Each of the following作者: Pelago 時間: 2025-3-27 14:12 作者: Amylase 時間: 2025-3-27 21:19 作者: SLAY 時間: 2025-3-27 22:03
Artiom Alhazov,Rudolf Freund,Gheorghe P?undiscusses an in-depth theory of function spaces in an Euclidean setting, including several new features, not previously covered in the literature. In particular, it develops a unified theory of anisotropic Besov and Bessel potential spaces on Euclidean corners, with infinite-dimensional Banach space作者: Tonometry 時間: 2025-3-28 03:35
S. Bandini,G. Mauri,G. Pavesi,C. Simonediscusses an in-depth theory of function spaces in an Euclidean setting, including several new features, not previously covered in the literature. In particular, it develops a unified theory of anisotropic Besov and Bessel potential spaces on Euclidean corners, with infinite-dimensional Banach space作者: 有節(jié)制 時間: 2025-3-28 06:45 作者: 啪心兒跳動 時間: 2025-3-28 12:59
Olivier Bournez,Emmanuel Hainrypproxi- tions mately. It emphasizes the dynamic viewpoint and is sufficiently general and flexible to encompass a great variety of concrete systems of partial differential equations occurring in science, some of those being of rather ‘nonstandard‘ type. In partic- ular, to date it is the only genera作者: 藥物 時間: 2025-3-28 17:00 作者: 香料 時間: 2025-3-28 20:50
Klaus W. Wagneroperties of algorithms and defines various notions of convergence. In turn, Part III extends the concepts developed in the second part to constrained optimization problems. Except for a few isolated sections, t978-3-030-85452-2978-3-030-85450-8Series ISSN 0884-8289 Series E-ISSN 2214-7934 作者: osteoclasts 時間: 2025-3-28 23:33
Rudolf Freund,Alberto Leporati,Marion Oswald,Claudio Zandron作者: 植物茂盛 時間: 2025-3-29 06:19
Chuzo Iwamoto,Naoki Hatayama,Kenichi Morita,Katsunobu Imai,Daisuke Wakamatsu作者: 謊言 時間: 2025-3-29 10:22
Hiroshi Umeo,Masaya Hisaoka,Masato Teraoka,Masashi Maeda作者: abreast 時間: 2025-3-29 12:55 作者: occult 時間: 2025-3-29 19:11 作者: 得罪 時間: 2025-3-29 20:49
Jean-Charles Delvenne,Petr K?rka,Vincent D. Blondel Thus the theory of nonlinear contraction semigroups does not apply to systems, in general, since they do not allow for a maximum principle. For these reasons w978-3-0348-9950-5978-3-0348-9221-6Series ISSN 1017-0480 Series E-ISSN 2296-4886 作者: 整理 時間: 2025-3-30 00:30 作者: 獎牌 時間: 2025-3-30 04:15 作者: Expand 時間: 2025-3-30 11:04 作者: 肉身 時間: 2025-3-30 12:26 作者: lattice 時間: 2025-3-30 20:12 作者: Charitable 時間: 2025-3-30 22:26
S. Bandini,G. Mauri,G. Pavesi,C. Simonectness theorems..The results presented pave the way for new applications in situations where infinite-dimensional target spaces are relevant – in the realm of stochastic differential equations, for example.. .978-3-030-11763-4Series ISSN 1017-0480 Series E-ISSN 2296-4886 作者: Liability 時間: 2025-3-31 01:49
Olivier Bournez,Emmanuel Hainryfound many applications, it is limited in its scope by the fact that, in concrete applications, it is closely tied to the maximum principle. Thus the theory of nonlinear contraction semigroups does not apply to systems, in general, since they do not allow for a maximum principle. For these reasons w作者: 怪物 時間: 2025-3-31 05:53
Algorithmic Randomness, Quantum Physics, and Incompletenesss? Can quantum randomness be used to trespass the Turing’s barrier? Can complexity shed more light on incompleteness? In this paper we use variants of “algorithmic complexity” to discuss the above questions.作者: LOPE 時間: 2025-3-31 10:09
Universality and Cellular Automatamputational Equivalence”. We discuss a classification for cellular automata that is based on computably enumerable degrees. In this setting the full structure of the semilattice of the c.e. degrees is inherited by the cellular automata.作者: Override 時間: 2025-3-31 15:02 作者: In-Situ 時間: 2025-3-31 18:29 作者: 鞠躬 時間: 2025-4-1 00:01
978-3-540-25261-0Springer-Verlag Berlin Heidelberg 2005作者: Scleroderma 時間: 2025-4-1 05:55 作者: canvass 時間: 2025-4-1 09:13
0302-9743 Overview: Includes supplementary material: 978-3-540-25261-0978-3-540-31834-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: cortex 時間: 2025-4-1 11:37
Maurice MargensternIncludes supplementary material:
