{"title":"带时间指令或带固定长度磁带的计算笔记","authors":"V. Rybakov","doi":"10.17516/1997-1397-2021-14-1-69-73","DOIUrl":null,"url":null,"abstract":"In this short note we analyze the computation algorithms modelled by Church-Turing-Post machines with algorithms for computation which use amount of time spent for computation (number of steps) in their own definitions. We notice some difference and illustrate that there are distinctions in behaviour of such algorithms; also we consider working of MTs on tapes of fixed length and observe again noticed difference","PeriodicalId":422202,"journal":{"name":"Journal of Siberian Federal University. Mathematics and Physics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Note on Computation MTs with Time in Instructions or with Tapes of Fixed Length\",\"authors\":\"V. Rybakov\",\"doi\":\"10.17516/1997-1397-2021-14-1-69-73\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this short note we analyze the computation algorithms modelled by Church-Turing-Post machines with algorithms for computation which use amount of time spent for computation (number of steps) in their own definitions. We notice some difference and illustrate that there are distinctions in behaviour of such algorithms; also we consider working of MTs on tapes of fixed length and observe again noticed difference\",\"PeriodicalId\":422202,\"journal\":{\"name\":\"Journal of Siberian Federal University. Mathematics and Physics\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Siberian Federal University. Mathematics and Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17516/1997-1397-2021-14-1-69-73\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Siberian Federal University. Mathematics and Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17516/1997-1397-2021-14-1-69-73","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Note on Computation MTs with Time in Instructions or with Tapes of Fixed Length
In this short note we analyze the computation algorithms modelled by Church-Turing-Post machines with algorithms for computation which use amount of time spent for computation (number of steps) in their own definitions. We notice some difference and illustrate that there are distinctions in behaviour of such algorithms; also we consider working of MTs on tapes of fixed length and observe again noticed difference
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
