Machines, Computations, and Universality最新文献

PSPACE-Completeness of Reversible Deterministic Systems 可逆确定性系统的pspace -完备性

Machines, Computations, and Universality Pub Date : 2022-07-14 DOI: 10.48550/arXiv.2207.07229

E. Demaine, R. Hearn, D. Hendrickson, J. Lynch

{"title":"PSPACE-Completeness of Reversible Deterministic Systems","authors":"E. Demaine, R. Hearn, D. Hendrickson, J. Lynch","doi":"10.48550/arXiv.2207.07229","DOIUrl":"https://doi.org/10.48550/arXiv.2207.07229","url":null,"abstract":"We prove PSPACE-completeness of several reversible, fully deterministic systems. At the core, we develop a framework for such proofs (building on a result of Tsukiji and Hagiwara and a framework for motion planning through gadgets), showing that any system that can implement three basic gadgets is PSPACE-complete. We then apply this framework to four different systems, showing its versatility. First, we prove that Deterministic Constraint Logic is PSPACE-complete, fixing an error in a previous argument from 2008. Second, we give a new PSPACE-hardness proof for the reversible ‘billiard ball’ model of Fredkin and Toffoli from 40 years ago, newly establishing hardness when only two balls move at once. Third, we prove PSPACE-completeness of zero-player motion planning with any reversible deterministic interacting [Formula: see text]-tunnel gadget and a ‘rotate clockwise’ gadget (a zero-player analog of branching hallways). Fourth, we give simpler proofs that zero-player motion planning is PSPACE-complete with just a single gadget, the 3-spinner. These results should in turn make it even easier to prove PSPACE-hardness of other reversible deterministic systems.","PeriodicalId":340847,"journal":{"name":"Machines, Computations, and Universality","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133974653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Control Mechanisms for Array Grammars on Cayley Grids Cayley网格上数组语法的控制机制

Machines, Computations, and Universality Pub Date : 2018-06-28 DOI: 10.1007/978-3-319-92402-1_1

R. Freund

引用次数: 2

Minimal Useful Size of Counters for (Real-Time) Multicounter Automata (实时)多计数器自动机的最小有用计数器尺寸

Machines, Computations, and Universality Pub Date : 2018-06-28 DOI: 10.1007/978-3-319-92402-1_6

V. Geffert, Z. Bednárová

引用次数: 0

Physical Computation and First-Order Logic 物理计算与一阶逻辑

Machines, Computations, and Universality Pub Date : 2018-06-28 DOI: 10.1007/978-3-319-92402-1_9

Richard Whyman

引用次数: 1

Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case 半条件语法中的最小化规则和非终结符:简单情况下的非平凡

Machines, Computations, and Universality Pub Date : 2018-06-28 DOI: 10.1007/978-3-319-92402-1_5

H. Fernau, Lakshmanan Kuppusamy, R. O. Oladele, Indhumathi Raman

引用次数: 1

Sequential Grammars with Activation and Blocking of Rules 具有激活和阻塞规则的顺序语法

Machines, Computations, and Universality Pub Date : 2018-06-28 DOI: 10.1007/978-3-319-92402-1_3

A. Alhazov, R. Freund, Sergiu Ivanov

引用次数: 5

A Pleasant Stroll Through the Land of Distributed Machines, Computation, and Universality 在分布式机器、计算和普适性领域的愉快漫步

Machines, Computations, and Universality Pub Date : 2018-06-28 DOI: 10.1007/978-3-319-92402-1_2

M. Raynal, Jiannong Cao

引用次数: 2

An Extension of Interval-Valued Computing Equivalent to Red-Green Turing Machines 红绿图灵机的区间值计算等价的扩展

Machines, Computations, and Universality Pub Date : 2018-06-28 DOI: 10.1007/978-3-319-92402-1_8

B. Nagy, S. Vályi

引用次数: 1

A framework for (de)composing with Boolean automata networks 一个布尔自动机网络的(反)组合框架

Machines, Computations, and Universality Pub Date : 2018-02-28 DOI: 10.1007/978-3-319-92402-1_7

Kévin Perrot, Pacôme Perrotin, Sylvain Sené

引用次数: 7

The language (and series) of Hammersley-type processes 哈默斯利类型过程的语言(和系列)

Machines, Computations, and Universality Pub Date : 2018-02-09 DOI: 10.1007/978-3-319-92402-1_4

C. Bonchis, Gabriel Istrate, Vlad Rochian

引用次数: 2