The Limits of Mathematics (Discrete Mathematics and Theoretical Computer Science)

The Limits of Mathematics (Discrete Mathematics and Theoretical Computer Science)

ID:39989979

大小:604.90 KB

页数:270页

时间:2019-07-16

The Limits of Mathematics (Discrete Mathematics and Theoretical Computer Science)_第1页
The Limits of Mathematics (Discrete Mathematics and Theoretical Computer Science)_第2页
The Limits of Mathematics (Discrete Mathematics and Theoretical Computer Science)_第3页
The Limits of Mathematics (Discrete Mathematics and Theoretical Computer Science)_第4页
The Limits of Mathematics (Discrete Mathematics and Theoretical Computer Science)_第5页
资源描述:

《The Limits of Mathematics (Discrete Mathematics and Theoretical Computer Science)》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、THELIMITSOFMATHEMATICSG.J.ChaitinIBM,POBox704YorktownHeights,NY10598chaitin@watson.ibm.comarXiv:chao-dyn/9407003v17Jul1994DraftJuly7,1994ToFran¸coisePrefaceInaremarkabledevelopment,Ihaveconstructedanewdefinitionforaself-delimitinguniversalTuringmachine(UTM)thatiseasytoprogramandrunsveryquickly.Thisp

2、rovidesanewfoundationforalgorithmicinformationtheory(AIT),whichisthetheoryofthesizeinbitsofprogramsforself-delimitingUTM’s.Previously,AIThadanabstractmathematicalquality.Nowitispossibletowritedownexecutableprogramsthatembodytheconstructionsintheproofsoftheorems.SoAITgoesfromdealingwithremoteidealiz

3、edmythicalobjectstobeingatheoryaboutpracticaldown-to-earthgadgetsthatonecanactuallyplaywithanduse.Thisnewself-delimitingUTMisimplementedviaanextremelyfastLISPinterpreterwritteninC.TheuniversalTuringmachineUiswrit-teninthisLISP.ThisLISPalsoservesasaveryhigh-levelassemblertoputtogetherbinaryprogramsf

4、orU.TheprogramsthatgointoU,andwhosesizewemeasure,arebitstrings.TheoutputfromU,ontheotherhand,consistsofasingleLISPS-expression,inthecaseoffinitecomputations,andofaninfinitesetoftheseS-expressions,inthecaseofinfinitecomputations.TheLISPusedhereisbasedontheversionofLISPthatIusedinmybookAlgorithmicInform

5、ationTheory,CambridgeUniversityPress,1987.Thedifferenceisthata)Ihavefoundaself-delimitingwaytogivebinarydatatoLISPprograms,andb)Ihavefoundanaturalwaytohandleunendingcomputations,whichiswhatformalaxiomaticsystemsare,inLISP.Usingthisnewsoftware,aswellasthelatesttheoreticalideas,itisnowpossibletogiveas

6、elf-contained“handson”coursepresentingveryconcretelymylatestproofsofmytwofundamentalinformation-vvitheoreticincompletenesstheorems.ThefirstofthesetheoremsstatesthatanN-bitformalaxiomaticsystemcannotenableonetoexhibitanyspecificobjectwithprogram-sizecomplexitygreaterthanN+c.Thesecondofthesetheoremssta

7、testhatanN-bitformalaxiomaticsystemcannotenableonetodeterminemorethanN+c′scatteredbitsofthehaltingprobabilityΩ.Mostpeoplebelievethatanythingthatistrueistrueforareason.Thesetheoremsshowthatsomethingsaretruef

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。