The concept of the algorithm, known from computability theory, should become the basis for an ontology of the Universe. This should lead to a change in the paradigm of natural science cognition. We argue that, with the exception of fundamental physical laws, all other laws are algorithmic. To illustrate this statement, the chess metaphor proposed by Richard Feynman is convenient, where the given rules of the game are the basic laws, and the laws of the deployment of compositions are the laws of the relationship between the basic elements in different situations. Since the game is algorithmic, it is possible to extend this property to the objective laws of the Universe. The main property of algorithmicity is the sequence of steps and information interaction. To express this, we introduce a new concept of time. The following definitions are given: 1) there is a set that we call "Time"; 2) this set consists of an infinite number of individual elements, which we call "Moments"; 3) all elements of a given set have a peculiarity: if one element is REAL, all other elements of the set are UNREAL; 4) we will call sets of this type – "AREAL SETS". It was found that the elementary areal relation is a logical law of contradiction: statements A and NOT-A together form an areal set of two elements. Formulating the law of contradiction, Aristotle and all the logicians after him constantly emphasized: there cannot be A and NOT-A in the same respect at the same TIME. We propose to rearrange the emphasis: in our formulation, AREALITY is a special logical relation that can simulate natural Time. The new model defines the time order in the form of definite characters’ sequence. The proposed ontology is related to the definition and introduction of the digital physics paradigm.
Pavel Vadimovich Poluian