Proposes definitions for computability concepts, highlighting their relevance to digital technologies and AI.
The paper proposes a system of definitions for basic concepts of computability theory that underlie the mathematics of the digital world: algorithm, computability, calculus, and object complexity close to modern understanding. Hierarchies of the finite and the problem of consistency are considered.
No takes yet. Share an insight, caveat, or question.
A. L. Semenov (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: