On Signifiable Computability: Part II: An Axiomatization of Signifiable Computation and Debugger Theorems
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 <inline-formula><math display="inline" xmlns="http...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-03-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/6/934 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|