On Programmatic Aspects of the Universality, Parameter, and Recursion Theorems of Classical Computability

Vladimir A. Kulyukin ()
Additional contact information
Vladimir A. Kulyukin: Department of Computer Science, Utah State University, Logan, UT 84322, USA

Mathematics, 2025, vol. 13, issue 13, 1-24

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.

Keywords: computability theory; universality theorem; parameter theorem; recursion theorem; recursion theory; lisp; computer science education (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/13/2090/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/13/2090/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:13:p:2090-:d:1687474

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().