On Programmatic Aspects of the Universality, Parameter, and Recursion Theorems of Classical Computability
The Universality, Parameter, and Recursion Theorems are three foundational results of classical computability theory. We show how these theorems can be programmatically illustrated and partially validated in Lisp. Our programs can be used as supplementary materials to texts on theoretical computer s...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-06-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/13/2090 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|