Comments on Kuhn's Closer to Truth

## comment 1

Please speak about MIT professors who create mathematics based on different axiomatics. I use the Greek prefix allo- like in allosaurus... allo- means different. I use the term allomathematics for mathematics based on different = not the common axiomatics. I substantiality = the real world based on the common calculatory/calculational mathematics or is the true ontological physics is it based on allomathematics = mathematics with different axiomatics? Different axiomatics doesn't mean that logic or constructor theory = Deutschian constructivism is violated. An allomathematical problem is usually (in almost all cases but not necessarily all; but it might be describable in a fragmented nonrigorous collage of formulas) transcribable into common mathematics. Is allomathematics (infinite allomathematics exist/can be invented) = mathematics with different than the common axiomatics transcribable into common mathematics? Yes in the vast majority of cases; but usually not by an overall/generic axiomatic transcription but by case-by-case problem/formulas transcription. Allomathematics is very important if we want to understand the true physics = physical reality = ontological physics = ontophysics and not scientophysics = the physics of science. The ideal scientophysics is identical/tautological to ontophysics, but we aren't there yet. We'll probably never get there according to the correct David Deutsch; because knowledge is infinite (see: renormalization which can be ontologically real and not merely calculatory/calculational; an infinite series of hypernymic Russian-doll wavefunctions; with the smaller Russian dolls contributing strongly to the observed region; the huge Russian dolls probabilistically contribute weakly to the ontological description of the central observed wavefunction). / What is an Ontological Turing Machine (it doesn't have to be a general calculator; at least at its foundations). An Ontological Turing Machine is a computer built from software, hardware and axiomatics which are of the same nature; expressed in the same formula or causally related ones. The common axiomatics of mathematics and geometry are scientific axiomatics = scientoaxiomatics, not derived from the same causal formula via logical proofs. Scientoaxiomatics is useful for science and general calculations but not causally coherent in a rigorous manner, originating from a common formula or algorithm. Ontoaxiomatics = ontological axiomatics = Ontological Turing Machine (which doesn't have to be a general calculator at its foundations, but it usually is on secondary logical formulas resulting form the main problem; which might seem a trivial problem but it isn't because you have to transcribe common formulas into huge forms in order to generate the general calculator feature).... Ontoaxiomatics is the axiomatics of the foundations of substantiality = universe-like worlds which are self-caused, not due to nihilogony/nilogony/cosmogony from nothing, but due to constructor theory = Deutschian constructivism = the foundations of substantiality itself are caused due to being Ontological Turing Machines. Theoretically an Ontological Turing Machine (which isn't foundationally a general calculator) are identical to Turing Machines (which are general calculators); but practically Ontological Turing Machines have more rigorous ontoaxiomatics (in future mathematicians might prove they are the one and the same). An ontoaxiomatics doesn't usually work as an uncaused list; an ontoaxiomatics (infinite are possible) works better as an algorithm, which is defined in connection to each problem itself. For example the electron necessarily exists within our universe and cannot exist as standalone in non-void nothing/the unvoid nothing/not even empty space/true inexistence. Also the ontoaxiomatics of an electron cannot be separated by the universe (ontoaxiomatics is part of the overall universe; the Ontological Turing Machine). David Deutsch doesn't only describe with his constructor theory (Deutschian constructivism) quantum foundations. Constructor theory is describing any phenomenon. My texts focuses mostly on the foundations of substantiality = Ontological Turing Machines = ontoaxiomatic algorithms which use Heisenberg's uncertainty principle and entropy in order to explain their self-causality via a connectome which ontologically changes if the relationships change, and no measurement without intervention is possible. Deutschian constructivism = constructor theory remains useful though even for the foundations of substantiality.