Muhammad Zeeshan, Rabia Nabila Rehman Nayab Nasir Saadia Anayat
{"title":"一个更容易理解图灵机停止问题的不可判定性的方法","authors":"Muhammad Zeeshan, Rabia Nabila Rehman Nayab Nasir Saadia Anayat","doi":"10.17781/P002157","DOIUrl":null,"url":null,"abstract":"This paper provides us an easier way to understand the undecidability of the halting problem of Turing machines. Our way is easier because author moves forward by discussing some past concepts in an easier way. The concept of Cantor’s diagonal argument has been discussed in an easier and simpler way that then helps us in understanding the undecidability of the halting problem of Turing machines.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"AN EASIER WAY TO UNDERSTAND THE UNDECIDABILITY OF HALTING PROBLEM OF TURING MACHINES\",\"authors\":\"Muhammad Zeeshan, Rabia Nabila Rehman Nayab Nasir Saadia Anayat\",\"doi\":\"10.17781/P002157\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper provides us an easier way to understand the undecidability of the halting problem of Turing machines. Our way is easier because author moves forward by discussing some past concepts in an easier way. The concept of Cantor’s diagonal argument has been discussed in an easier and simpler way that then helps us in understanding the undecidability of the halting problem of Turing machines.\",\"PeriodicalId\":211757,\"journal\":{\"name\":\"International journal of new computer architectures and their applications\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of new computer architectures and their applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17781/P002157\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of new computer architectures and their applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17781/P002157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
AN EASIER WAY TO UNDERSTAND THE UNDECIDABILITY OF HALTING PROBLEM OF TURING MACHINES
This paper provides us an easier way to understand the undecidability of the halting problem of Turing machines. Our way is easier because author moves forward by discussing some past concepts in an easier way. The concept of Cantor’s diagonal argument has been discussed in an easier and simpler way that then helps us in understanding the undecidability of the halting problem of Turing machines.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
