標(biāo)題: Titlebook: Machines, Computations, and Universality; 5th International Co Jér?me Durand-Lose,Maurice Margenstern Conference proceedings 2007 Springer- [打印本頁] 作者: 會(huì)議記錄 時(shí)間: 2025-3-21 19:00
書目名稱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é)科排名
作者: arcane 時(shí)間: 2025-3-21 21:35 作者: 平庸的人或物 時(shí)間: 2025-3-22 03:09 作者: Trabeculoplasty 時(shí)間: 2025-3-22 07:31
A Universal Reversible Turing Machines paper, we study the problem of finding a small universal reversible Turing machine (URTM). As a result, we obtained a 17-state 5-symbol URTM in the quintuple form that can simulate any cyclic tag system.作者: 使成波狀 時(shí)間: 2025-3-22 08:54 作者: gout109 時(shí)間: 2025-3-22 15:15
Uniform Solution of QSAT Using Polarizationless Active Membranesanes with non–elementary membrane division. We present a double improvement of this result by showing that the satisfiability of a . Boolean formula (.) can be solved by a . family of P systems of the same kind.作者: arrogant 時(shí)間: 2025-3-22 19:44
978-3-540-74592-1Springer-Verlag Berlin Heidelberg 2007作者: 建筑師 時(shí)間: 2025-3-22 21:21 作者: Arroyo 時(shí)間: 2025-3-23 03:53
0302-9743 Overview: 978-3-540-74592-1978-3-540-74593-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 阻礙 時(shí)間: 2025-3-23 09:35
On the Computational Capabilities of Several ModelsWe review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems.作者: DECRY 時(shí)間: 2025-3-24 05:34 作者: gastritis 時(shí)間: 2025-3-24 08:13 作者: 怪物 時(shí)間: 2025-3-24 13:50
Liesbeth De Mole Chapter 3 is devoted to discrete-time systems..The main aim of this book is to develop the H-infinity and H2 theory for jump systems and to apply it to sampled-data systems. The jump system gives a natural state space representation of sampled-data systems, and original signals and parameters are 作者: 長矛 時(shí)間: 2025-3-24 15:13 作者: 挖掘 時(shí)間: 2025-3-24 22:49
Hermann Gruber,Markus Holzer,Martin Kutrib time-varying systemsThis book gives an introduction to H-infinity and H2 control for linear time-varying systems. Chapter 2 is concerned with continuous-time systems while Chapter 3 is devoted to discrete-time systems..The main aim of this book is to develop the H-infinity and H2 theory for jump sy作者: Accomplish 時(shí)間: 2025-3-25 02:12 作者: 細(xì)微的差異 時(shí)間: 2025-3-25 05:47 作者: FER 時(shí)間: 2025-3-25 10:24 作者: albuminuria 時(shí)間: 2025-3-25 11:40 作者: HEPA-filter 時(shí)間: 2025-3-25 18:05 作者: 頭腦冷靜 時(shí)間: 2025-3-25 23:35
A Survey of Infinite Time Turing Machinesinitary computability, with robust notions of computability and decidability on the reals, while remaining close to classical concepts of computability. Here, I survey the theory of infinite time Turing machines and recent developments. These include the rise of infinite time complexity theory, the 作者: dissent 時(shí)間: 2025-3-26 03:31 作者: Legion 時(shí)間: 2025-3-26 06:40 作者: Perceive 時(shí)間: 2025-3-26 09:25
Uniform Solution of QSAT Using Polarizationless Active Membranesanes with non–elementary membrane division. We present a double improvement of this result by showing that the satisfiability of a . Boolean formula (.) can be solved by a . family of P systems of the same kind.作者: 盡責(zé) 時(shí)間: 2025-3-26 15:50
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problemoblem becomes undecidable. We study the counting version and the unique version of this problem. We prove that the satisfiability problem parsimoniously reduces to the Tantrix. rotation puzzle problem. In particular, this reduction preserves the uniqueness of the solution, which implies that the uni作者: 下垂 時(shí)間: 2025-3-26 17:30 作者: 范例 時(shí)間: 2025-3-27 00:56
On the Power of Networks of Evolutionary Processorsoid) every recursively enumerable language can be generated by a network with one deletion and two insertion nodes. Networks with an arbitrary number of deletion and substitution nodes only produce finite languages, and for each finite language one deletion node or one substitution node is sufficien作者: 保存 時(shí)間: 2025-3-27 03:41 作者: 浸軟 時(shí)間: 2025-3-27 07:25
More on the Size of Higman-Haines Sets: Effective Constructionsat these sets . be effectively computed in general. Here the Higman-Haines sets are the languages of all scattered subwords of a given language and the sets of all words that contain some word of a given language as a scattered subword. Recently, the exact level of unsolvability of Higman-Haines set作者: neologism 時(shí)間: 2025-3-27 11:33 作者: 社團(tuán) 時(shí)間: 2025-3-27 14:24 作者: 極力證明 時(shí)間: 2025-3-27 19:00 作者: FACET 時(shí)間: 2025-3-28 00:25
More on the Size of Higman-Haines Sets: Effective Constructionsn-Haines sets for the lower classes of the Chomsky hierarchy, namely for the families of regular, linear context-free, and context-free languages, and prove upper and lower bounds on the size of these sets.作者: 相符 時(shí)間: 2025-3-28 04:07
Query Completeness of Skolem Machine Computationsomplete Geolog trees is defined, and this tree concept is used to show logical completeness for Skolem machines: If the query for a Geolog theory is a logical consequence of the axioms then the corresponding Skolem machine halts succesfully in a configuration that supports the query.作者: Aqueous-Humor 時(shí)間: 2025-3-28 09:17 作者: Enthralling 時(shí)間: 2025-3-28 14:30
Universality, Reducibility, and Completenessare based on the construction of reduction of problems; all considered concepts of reduction, as well as deduction in logic are kinds of reduction of abstract properties. The Church-Turing Thesis, which states universality of the class of all Turing machines, is considered in a mathematical setting as a theorem proved under definite conditions.作者: Genistein 時(shí)間: 2025-3-28 16:13
Using Approximation to Relate Computational Classes over the Realses of functions, exploiting the transitive nature of the approximation relation. This work builds on our earlier work with our method of approximation, giving more evidence of the breadth of its applicability.作者: –FER 時(shí)間: 2025-3-28 19:11 作者: Sarcoma 時(shí)間: 2025-3-28 23:05 作者: Digitalis 時(shí)間: 2025-3-29 05:23
On the Power of Networks of Evolutionary Processorst. Networks with an arbitrary number of insertion and substitution nodes only generate context-sensitive languages, and (up to an intersection with a monoid) every context-sensitive language can be generated by a network with one substitution node and one insertion node.作者: 欄桿 時(shí)間: 2025-3-29 10:30
Insertion-Deletion Systems with One-Sided Contextspleteness if a cooperation of 4 symbols is used for insertion rules and not sufficient if an insertion of one symbol in one-symbol left and right context is used. We also prove the computational completeness for the case of the minimal context-free deletion (of two symbols) and insertion of two symbols in one-symbol one-sided context.作者: olfction 時(shí)間: 2025-3-29 13:36 作者: neuron 時(shí)間: 2025-3-29 19:17 作者: 反抗者 時(shí)間: 2025-3-29 23:26
John Fisher,Marc Bezemy given for time-invariant systems is extended to time-varying systems. The H-infinity and H2 theory for sampled-data systems is established from the jump system point of view. Extension of the theory to infinite dimensional systems and nonlinear systems is discussed. This covers the sampled-data sy作者: Aura231 時(shí)間: 2025-3-30 03:54
Artiom Matveevici,Yurii Rogozhin,Sergey Verlany given for time-invariant systems is extended to time-varying systems. The H-infinity and H2 theory for sampled-data systems is established from the jump system point of view. Extension of the theory to infinite dimensional systems and nonlinear systems is discussed. This covers the sampled-data sy作者: 光亮 時(shí)間: 2025-3-30 07:42 作者: Offbeat 時(shí)間: 2025-3-30 11:03
Tommaso Bolognesiestablished from the jump system point of view. Extension of the theory to infinite dimensional systems and nonlinear systems is discussed. This covers the sampled-data sy978-1-85233-439-0978-1-84628-575-2Series ISSN 0170-8643 Series E-ISSN 1610-7411 作者: creditor 時(shí)間: 2025-3-30 15:46
Hermann Gruber,Markus Holzer,Martin Kutribestablished from the jump system point of view. Extension of the theory to infinite dimensional systems and nonlinear systems is discussed. This covers the sampled-data sy978-1-85233-439-0978-1-84628-575-2Series ISSN 0170-8643 Series E-ISSN 1610-7411 作者: 飲料 時(shí)間: 2025-3-30 16:49 作者: aggravate 時(shí)間: 2025-3-30 23:06 作者: chance 時(shí)間: 2025-3-31 02:36
7樓作者: STIT 時(shí)間: 2025-3-31 08:47
7樓作者: 可耕種 時(shí)間: 2025-3-31 09:22
7樓作者: 同音 時(shí)間: 2025-3-31 13:50
7樓作者: FRET 時(shí)間: 2025-3-31 20:57
8樓作者: Lament 時(shí)間: 2025-3-31 21:52
8樓作者: 大猩猩 時(shí)間: 2025-4-1 03:19
8樓作者: jaunty 時(shí)間: 2025-4-1 07:36
8樓作者: 疾馳 時(shí)間: 2025-4-1 11:58
9樓作者: 男生如果明白 時(shí)間: 2025-4-1 16:51
9樓作者: AWRY 時(shí)間: 2025-4-1 18:53
9樓作者: Canary 時(shí)間: 2025-4-1 23:50
9樓作者: gait-cycle 時(shí)間: 2025-4-2 04:52
10樓作者: Adrenal-Glands 時(shí)間: 2025-4-2 07:35
10樓作者: VALID 時(shí)間: 2025-4-2 12:14
10樓作者: ineluctable 時(shí)間: 2025-4-2 18:11
10樓
