Document Type
Article
Author ORCID Identifier
Vladimir A. Kulyukin https://orcid.org/0000-0002-8778-5175
Journal/Book Title/Conference
Mathematics
Volume
13
Issue
13
Publisher
MDPI AG
Publication Date
6-25-2025
Journal Article Version
Version of Record
First Page
1
Last Page
24
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Abstract
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 science, mathematical logic, or metamathematics.
Recommended Citation
Kulyukin, V.A. On Programmatic Aspects of the Universality, Parameter, and Recursion Theorems of Classical Computability. Mathematics 2025, 13, 2090. https://doi.org/10.3390/math13132090