相空间可逆异步元胞自动机

AUTOMATA & JAC Pub Date : 2012-08-13 DOI:10.4204/EPTCS.90.19

S. Wacker, T. Worsch

{"title":"相空间可逆异步元胞自动机","authors":"S. Wacker, T. Worsch","doi":"10.4204/EPTCS.90.19","DOIUrl":null,"url":null,"abstract":"While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invertible asynchronous cellular automata in more detail. We will show that for each Turing machine there is such a cellular automaton simulating it, and that it is decidable whether an asynchronous cellular automaton has this property or not, even in higher dimensions.","PeriodicalId":415843,"journal":{"name":"AUTOMATA & JAC","volume":"186 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Phase Space Invertible Asynchronous Cellular Automata\",\"authors\":\"S. Wacker, T. Worsch\",\"doi\":\"10.4204/EPTCS.90.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invertible asynchronous cellular automata in more detail. We will show that for each Turing machine there is such a cellular automaton simulating it, and that it is decidable whether an asynchronous cellular automaton has this property or not, even in higher dimensions.\",\"PeriodicalId\":415843,\"journal\":{\"name\":\"AUTOMATA & JAC\",\"volume\":\"186 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATA & JAC\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.90.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATA & JAC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.90.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

虽然对于同步确定性元胞自动机有一个公认的可逆性定义，但对于异步元胞自动机，情况就不太清楚了。我们首先讨论了几种可能性，然后更详细地研究了所谓的相空间可逆异步元胞自动机。我们将证明，对于每个图灵机，都有一个这样的元胞自动机来模拟它，并且异步元胞自动机是否具有这种性质是可确定的，即使在高维中也是如此。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Phase Space Invertible Asynchronous Cellular Automata

While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invertible asynchronous cellular automata in more detail. We will show that for each Turing machine there is such a cellular automaton simulating it, and that it is decidable whether an asynchronous cellular automaton has this property or not, even in higher dimensions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

AUTOMATA & JAC

自引率

0.00%

发文量