Kleene, Rogers and Rice Theorems Revisited in C and in Bash
Salvatore Caporaso, Nicola Corriero

TL;DR
This paper revisits fundamental recursion and Rice theorems, demonstrating their proofs using programs written in C and Bash scripts, highlighting alternative implementation approaches.
Contribution
It provides the first proofs of these theorems using C and Bash, offering new perspectives on classical computability results.
Findings
Proofs of the recursion theorem in C and Bash
Proofs of Rice's theorem in C and Bash
Demonstration of alternative proof methods in scripting languages
Abstract
The recursion theorem in the weak form {e}(z)=x(e,z) (universal function not needed) and in Rogers form {n}(z)={{x}(n)}(z) and Rice theorem are proved a first time using programs in C, and a second time with scripts in Bash.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Algorithms and Data Compression
