{"title":"带有循环限制的交替","authors":"J.M. Robson","doi":"10.1016/S0019-9958(85)80023-1","DOIUrl":null,"url":null,"abstract":"<div><p>Alternating Turing machines with restrictions preventing them from returning to a previous configuration model games with rules enforcing such a restriction, for instance, the Chinese version of Go. Such restrictions do not affect the time complexity of problems for alternating Turing machines but space <em>S</em> on a machine with the restriction is equivalent either to time or to space exponential in <em>S</em> on a normal alternating machine, depending on the precise nature of the restriction.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 2-11"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80023-1","citationCount":"7","resultStr":"{\"title\":\"Alternation with restrictions on looping\",\"authors\":\"J.M. Robson\",\"doi\":\"10.1016/S0019-9958(85)80023-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Alternating Turing machines with restrictions preventing them from returning to a previous configuration model games with rules enforcing such a restriction, for instance, the Chinese version of Go. Such restrictions do not affect the time complexity of problems for alternating Turing machines but space <em>S</em> on a machine with the restriction is equivalent either to time or to space exponential in <em>S</em> on a normal alternating machine, depending on the precise nature of the restriction.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"67 1\",\"pages\":\"Pages 2-11\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80023-1\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800231\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
Alternating Turing machines with restrictions preventing them from returning to a previous configuration model games with rules enforcing such a restriction, for instance, the Chinese version of Go. Such restrictions do not affect the time complexity of problems for alternating Turing machines but space S on a machine with the restriction is equivalent either to time or to space exponential in S on a normal alternating machine, depending on the precise nature of the restriction.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
