Mathematical foundations of epistemology based~on~experiments

S. M. Krylov

Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences, Tome 19 (2015) no. 3, pp. 534-558.

Résumé

The paper deals with basic prerequisites for the development of epistemology, which uses information concerning real experiments in the real world (with real objects). Such experiments are conducted by “formal-technological” analogs of Turing Machines. These analogs are called “universal synthesizers-analyzers”. They can perform syntheses and analyses of various objects or constructions (obtained by conjunctions of finite number of smaller objects called basic elements) with the help of various algorithmic systems having some restrictions. Such algorithmic systems are called Formal Technologies. They have formal structures that are very similar to the formal structure of Maltsev's algebraic systems. This formal closeness allows us, first, to set up a hypothesis concerning algorithmic basis of almost all surrounding physical processes, as understandable as well as till non-understandable ones, that partially explains the wide applicability of mathematics to the outer world; second, this closeness allows one to formulate and prove some theorems (called assertions) concerning features and peculiar properties of cognitive algorithms in one-, two- or three-dimensional surroundings for various formal technological systems, including a so called “acquired knowledge effectiveness theorem”. The theorem (assertion) can be applied to a very wide class of formal technologies which use an equality predicate for objects analyses. In the paper various cognitive algorithms are listed and proved. These algorithms have different sets of technological operations resembling syntheses and decompositions, as well as different sets of analytical operations including equality predicates, “random stationary mapping” operations (which use unknown algorithms to obtain stationary results, therefore these operations are very similar to oracles in Turing Machines), operations that define object shapes, and so on. The structure of automatic cognitive devices called “cognizers” is described.

Détail

Keywords: cognitive algorithms, physical processes with physical objects, General Formal Technology, General System Theory, object properties, object functionalities, universal object synthesizer-analyzer, universal cognizer.

Bibliographie

[1] Gavrilova T. A., Khoroshevskii V. F., Bazy znanii intellektual'nykh sistem [Knowledge Base intelligent systems], Piter, St. Petersburg, 2000, 384 pp. (In Russian)

[2] Novikova V. A., Andreeva E. Iu., Tuikina D. K., Iskusstvennyi intellekt i ekspertnye sistemy [Artificial intelligence and expert systems], 2007 (In Russian)

[3] Krylov S. M., Formal'naia tekhnologiia i evoliutsiia [Formal technology and evolution], Moscow, Mashinostroenie-1, 2006, 384 pp. (In Russian)

[4] Krylov S. M., “Mathematical foundations of metaphysics”, Vestn. Samar. Gos. Tekhn. Univ. Ser. Fiz.-Mat. Nauki [J. Samara State Tech. Univ., Ser. Phys. Math. Sci.], 2012, no. 1(26), 233–242 (In Russian) | DOI

[5] Krylov S. M., “Prospects of metamathematical structures in science”, Vestn. Samar. Gos. Tekhn. Univ. Ser. Fiz.-Mat. Nauki [J. Samara State Tech. Univ., Ser. Phys. Math. Sci.], 2013, no. 2(31), 101–110 (In Russian) | DOI

[6] Krylov S. M., Metamatematicheskie osnovy nauki budushchego [Metamathematical foundations of the science of the future], Samara State Technical Univ., Samara, 2014, 247 pp. (In Russian)

[7] Krylov S. M., “Multifunctional Remote Laboratories for Real Experiments, Engineering Processes, and Manufacturing Methods”, International Journal of Online Engineering, 10:5 (2014), 29–30 | DOI

[8] Maltsev A. I., Algebraic Systems, Springer-Verlag, Berlin, 1973, xii+317 pp. | MR | MR | Zbl

[9] Hamming R. W., “The Unreasonable Effectiveness of Mathematics”, The American Mathematical Monthly, 87:2 (1980), 81–90 | DOI | MR

[10] Algoritmy v sovremennoi matematike i ee prilozheniiakh [Algorithms in Modern Mathematics and Computer Science], Proceedings of the International Symposium, Novosibirsk, 1982, 364 pp. (In Russian)

[11] Tegmark M., Our Mathematical Universe: My Quest for the Ultimate Nature of Reality, Knopf, Random House Tower, New York, 2014, 432 pp. | Zbl

[12] Uspensky V. A., Gödel's Incompleteness Theorem, Little Mathematics Library, Mir Publ., Moscow, 1987, 104 pp. | MR

[13] Maltsev A. I., Algorithms and recursive functions, Wolters-Noordhoff Publ., Groningen, 1970, 372 pp. | MR | MR | Zbl

[14] Shoenfield J. R., Degrees of Unsolvability, North-Holland Mathematics Studies, 2, 1971, viii+111 pp. | MR | Zbl

[15] Manna Z., Mathematical Theory of Computation, McGraw-Hill Computer Science Series, McGraw-Hill Inc., New-York, 1974, x+448 pp. | MR | Zbl

[16] Krylov S. M., “Universal Programmable Completely Automated Factories-on-a-Chip”, Proc. of the COMS2004 (Aug. 29 – Sept. 2, 2004), MANCEF, Edmonton, Alberta, Canada, Washington, 2004, 269–273

[17] Krylov S. M., “Formal technology and universal systems. I”, Cybernetics, 22:4 (1986), 512–518 | DOI

[18] Krylov S. M., “Formal technology and universal systems. II”, Cybernetics, 22:5 (1986), 567–572 | DOI

[19] Krylov S. M., “Formal Technology and Cognitive Processes”, International Journal of General Systems, 24:3 (1996), 233–243 | DOI

[20] Shinichi Tamura, Kokichi Tanaka, “Note on Analog Memory Automata”, Information Sciences, 7 (1974), 73–80 | DOI | MR | Zbl

[21] Krylov S. M., “Models of universal discrete-analog machines based on Turing machine”, Elektronnoye modelirovaniye, 1982, no. 3, 6–10 (In Russian) | MR

[22] Krylov S. M., “The proof of action boundedness for Turing–Church thesis on objects with physical properties”, Vestn. Orenburg. Gos. Univ., 2003, no. 3, 102–105 (In Russian)

[23] Martynenko B. K., Iazyki i transliatsii [Languages and Translation], St. Petersburg State Univ., St. Petersburg, 2013, 265 pp. (in Russian)