网站大量收购独家精品文档,联系QQ:2885784924

Kleene, Rogers and Rice Theorems Revisited in C and in Bash.pdf

Kleene, Rogers and Rice Theorems Revisited in C and in Bash.pdf

  1. 1、本文档共10页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Kleene, Rogers and Rice Theorems Revisited in C and in Bash

a r X i v : 0 7 1 2 .1 2 7 9 v 1 [ c s .L O ] 8 D e c 2 0 0 7 Kleene, Rogers and Rice Theorems Revisited in C and in Bash Salvatore Caporaso (caporaso@di.uniba.it) Nicola Corriero (nicolacorriero@) Dipartimento d’Informatica dell’Universita? di Bari Abstract The recursion theorem in the weak form {e}(z) = x(e, z) (universal function not needed) and in Rogers form φφf(n)(z) = φn(z), and Rice theorem are proved a first time using programs in C, and a second time with scripts in Bash. 1 Introduction One of the cornerstones of recursion theory is the result known as S?m?n theorem (in honour of the original notation by Kleene, who called it Iteration Theorem) or as Parameter Theorem (after Schoenfield). Its proofs in Literature however are not fully satisfatory for a computer scientist. Some authors merely appeal to Church thesis (Rogers [6], Cutland [1], Enderton [2]). Some others arithmetize the metaprocessing, and this disguise the computation under a misleading plenty of numerical technicalities (Kleene [5], Smorynski[7]). The proof by Kechris and Moschovakis [3] use a universal function, which is not available when classes of total functions are discussed, like in the case, for example, of security or complexity classes. Among the consequences of the S?m?n we have the Kleene weak form of the Recursion Theorem (existence of a fixed-point value), the Rogers form (functional fixed-point), Rice theorem, the analysis by Thompson [8] in his Turing lecture of relationship between malware and Quine’s indirect self-referential paradox. We feel that simple idea need simple programs, and that, therefore, understanding these phenomena needs their revisitation in terms of real programming. In this paper we show that this is rather easy in C; and even easier in a language allowing quick writing of rough programs like Bash. To this purpose, we code, in both these languages, the procedures needed to prove the results mentioned above. A by-result of this work is that one can

您可能关注的文档

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档