On Signifiable Computability: Part II: An Axiomatization of Signifiable Computation and Debugger Theorems

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 6, 1-36

Abstract: Signifiable computability aims to separate what is theoretically computable from what is computable through performable processes on computers with finite amounts of memory. Mathematical objects are signifiable in a formalism L on an alphabet A if they can be written as spatiotemporally finite texts in L on A . In a previous article, we formalized the signification and reference of real numbers and showed that data structures representable as multidimensional matrices of discretely finite real numbers are signifiable. In this investigation, we continue to formulate our theory of signifiable computability by offering an axiomatization of signifiable computation on discretely finite real numbers. The axiomatization implies an ontology of functions on discretely finite real numbers that classifies them as signifiable, signifiably computable, and signifiably partially computable. Relative to L and A , signification is performed with two formal systems: the Former F ¨ ^ A , L that forms texts in L on A and the Transformer T ¨ ^ A , L that transforms texts formed by F ¨ ^ A , L into other texts in L on A . Singifiable computation is defined relative to L on A as a finite sequence of signifiable program states, the first of which is generated by F ¨ ^ A , L and each subsequent state is deterministically obtained from the previous one by T ¨ ^ A , L . We define a debugger function to investigate signifiable computation on finite-memory devices and to prove two theorems, which we call the Debugger Theorems. The first theorem shows that, for a singifiably partially computable function signified by a program on a finite-memory device D , the memory capacity of D is exceeded when running the program on signifiable discretely finite real numbers outside of the function’s domain. The second theorem shows that there are functions signifiably computable in general that become partially signifiably computable when signified by programs on D insomuch as the memory capacity of D can be exceeded even when the programs are executed on some signifiable discretely finite real numbers in the domains of these functions.

Keywords: computability theory; recursion theory; signifiable computability; axiomatization; debugger theorems; discretely finite real numbers; number theory (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/6/934/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/6/934/ (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:6:p:934-:d:1610178

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 ().