{"title":"计算模型的等价问题:可判定和不可判定的情况","authors":"V. Zakharov","doi":"10.1007/3-540-45132-3_8","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":340847,"journal":{"name":"Machines, Computations, and Universality","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"The Equivalence Problem for Computational Models: Decidable and Undecidable Cases\",\"authors\":\"V. Zakharov\",\"doi\":\"10.1007/3-540-45132-3_8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":340847,\"journal\":{\"name\":\"Machines, Computations, and Universality\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Machines, Computations, and Universality\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-45132-3_8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Machines, Computations, and Universality","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-45132-3_8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}