On Signifiable Computability: Part III: A Note on Unnameable Functions on Natural Numbers
Abstract
A writing system W on an alphabet A is a tuple (R,M), where R is a finite set of text formation rules and M is a finite rule application mechanism that generates texts on A. A natural writing system forms natural language texts on an alphabet such as Sanskrit on Devanagari. An artificial writing system generates formal language texts on an alphabet such as Lisp on Unicode. Let N={0,1,2,…} be the set of natural numbers. A function on natural numbers f:Nk↦N, 0
Fields of Study & Subjects
Computability
Logic
AI Algorithms
semigroups and automata theory
programming
and type systems
Publication details
- Journal / source
- Computers
- Volume
- 15
- Issue
- 3
- Pages
- 146–146
- Publication date
- 1 March 2026
- Language
- EN