On Basic Mathematical Definitions of Digital Technologies and Artificial Intelligence
摘要
Abstract
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.