扩展丘奇-图灵论题的形式化与证明-扩展摘要-

Dialogues in cardiovascular medicine : DCM Pub Date : 2012-07-30 DOI:10.4204/EPTCS.88.6

N. Dershowitz, Evgenia Falkovich

{"title":"扩展丘奇-图灵论题的形式化与证明-扩展摘要-","authors":"N. Dershowitz, Evgenia Falkovich","doi":"10.4204/EPTCS.88.6","DOIUrl":null,"url":null,"abstract":"We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract state machine by a random access machine, representing data as a minimal term graph.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"2010 1","pages":"72-78"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-\",\"authors\":\"N. Dershowitz, Evgenia Falkovich\",\"doi\":\"10.4204/EPTCS.88.6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract state machine by a random access machine, representing data as a minimal term graph.\",\"PeriodicalId\":88470,\"journal\":{\"name\":\"Dialogues in cardiovascular medicine : DCM\",\"volume\":\"2010 1\",\"pages\":\"72-78\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Dialogues in cardiovascular medicine : DCM\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.88.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Dialogues in cardiovascular medicine : DCM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.88.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

摘要

我们证明了扩展的丘奇-图灵命题:每一个有效的算法都可以用图灵机有效地模拟。这是通过通过抽象状态机模拟有效的算法，并通过随机访问机模拟这样的抽象状态机来实现的，将数据表示为最小项图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-

We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract state machine by a random access machine, representing data as a minimal term graph.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Dialogues in cardiovascular medicine : DCM

自引率

0.00%

发文量