Mathematical foundations of epistemology based on experiments
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 synthesizer...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Samara State Technical University
2015-09-01
|
| Series: | Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki |
| Subjects: | |
| Online Access: | https://journals.eco-vector.com/1991-8615/article/viewFile/20468/16715 |
| _version_ | 1818024587748704256 |
|---|---|
| author | Sergey M Krylov |
| author_facet | Sergey M Krylov |
| author_sort | Sergey M Krylov |
| collection | DOAJ |
| description | 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 synthesizersanalyzers”. 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. |
| first_indexed | 2024-12-10T04:02:35Z |
| format | Article |
| id | doaj.art-81d48fe91a29456186f84e0590b17b29 |
| institution | Directory Open Access Journal |
| issn | 1991-8615 2310-7081 |
| language | English |
| last_indexed | 2024-12-10T04:02:35Z |
| publishDate | 2015-09-01 |
| publisher | Samara State Technical University |
| record_format | Article |
| series | Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki |
| spelling | doaj.art-81d48fe91a29456186f84e0590b17b292022-12-22T02:02:56ZengSamara State Technical UniversityVestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki1991-86152310-70812015-09-0119353455810.14498/vsgtu142717888Mathematical foundations of epistemology based on experimentsSergey M Krylov0Samara State Technical UniversityThe 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 synthesizersanalyzers”. 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.https://journals.eco-vector.com/1991-8615/article/viewFile/20468/16715cognitive algorithmsphysical processes with physical objectsgeneral formal technologygeneral system theoryobject propertiesobject functionalitiesuniversal object synthesizer-analyzeruniversal cognizer |
| spellingShingle | Sergey M Krylov Mathematical foundations of epistemology based on experiments Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki cognitive algorithms physical processes with physical objects general formal technology general system theory object properties object functionalities universal object synthesizer-analyzer universal cognizer |
| title | Mathematical foundations of epistemology based on experiments |
| title_full | Mathematical foundations of epistemology based on experiments |
| title_fullStr | Mathematical foundations of epistemology based on experiments |
| title_full_unstemmed | Mathematical foundations of epistemology based on experiments |
| title_short | Mathematical foundations of epistemology based on experiments |
| title_sort | mathematical foundations of epistemology based on experiments |
| topic | cognitive algorithms physical processes with physical objects general formal technology general system theory object properties object functionalities universal object synthesizer-analyzer universal cognizer |
| url | https://journals.eco-vector.com/1991-8615/article/viewFile/20468/16715 |
| work_keys_str_mv | AT sergeymkrylov mathematicalfoundationsofepistemologybasedonexperiments |