{"title":"双曲平面的多米诺问题是不可判定的:新的证明","authors":"Maurice Margenstern","doi":"10.25088/complexsystems.32.1.19","DOIUrl":null,"url":null,"abstract":"The present paper revisits the proof given in a paper of the author published in 2008 proving that the general tiling problem of the hyperbolic plane is algorithmically unsolvable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael Robinson in 1971, in his famous simplified proof that the general tiling problem is algorithmically unsolvable for the Euclidean plane, initially proved by Robert Berger in 1966. The present construction improves that of the 2008 paper. It also very strongly reduces the number of prototiles.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Domino Problem of the Hyperbolic Plane Is Undecidable: New Proof\",\"authors\":\"Maurice Margenstern\",\"doi\":\"10.25088/complexsystems.32.1.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The present paper revisits the proof given in a paper of the author published in 2008 proving that the general tiling problem of the hyperbolic plane is algorithmically unsolvable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael Robinson in 1971, in his famous simplified proof that the general tiling problem is algorithmically unsolvable for the Euclidean plane, initially proved by Robert Berger in 1966. The present construction improves that of the 2008 paper. It also very strongly reduces the number of prototiles.\",\"PeriodicalId\":46935,\"journal\":{\"name\":\"Complex Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complex Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.25088/complexsystems.32.1.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complex Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25088/complexsystems.32.1.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
The Domino Problem of the Hyperbolic Plane Is Undecidable: New Proof
The present paper revisits the proof given in a paper of the author published in 2008 proving that the general tiling problem of the hyperbolic plane is algorithmically unsolvable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael Robinson in 1971, in his famous simplified proof that the general tiling problem is algorithmically unsolvable for the Euclidean plane, initially proved by Robert Berger in 1966. The present construction improves that of the 2008 paper. It also very strongly reduces the number of prototiles.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
