I have invented a new theory of computing that I have called "The theory of self-reproducing machines" and have discovered a very interesting infinite family of self-reproducing machines, as well as a new set of mathematical laws that govern these types of systems, which extends Cellular Automata and John Conways "The Game of Life" using my new "computer virus techniques" methods to write common non-malicious computer programs. Since I'm an inventor, I have a lot of crazy ideas. This really is it and I follow it and I desperately need expert help, and this is the purpose of my question right now

very briefly here is my guess

Conjecture 1: The theory of Turing machines of self-reproduction or The theory of machines of self-reproduction is a complete theory of Turing computation that generalizes the previous theory of computation. It is possible to solve problems in the NP-Complete "complexity class" (a term that I will define in my next conjecture). This new theory of computation involves adding a new axiom to the theory of computation above that will result in a violation of the church-turing thesis and enable an algorithm that I have already written in JavaScript and tested in my debugging tool, to know, that Turing Machines have a magical axiomatic function where they can self-replicate.

Conjecture 2: According to my new theory of computation, the class (according to the class defined by class theory in the von neumann sense) of NP problems can be divided into different subsets that I have just called "complexity classes" of which NP-complete is the lowest level,

These complexity classes can be mapped 1-1 to other problems by a type of isomoprism that I call "complexity class homomorphisms" and we can understand the different types of exponential growth in Big-O complexity estimation by this type of operation.

Furthermore, the different types of Big-O efficiency notation in use must be expanded to include orders of infinity according to Cantors theory of infinite sets using a new Axiom stating that there is no infinite set with complexity class between integers and integers.

Furthermore, the relation of types of equity that I have just conjectured can be mapped 1-1 by a complexity class homomorphism to these orders of infinity that I have just described

Furthermore, the complexity class of the integer factorization problem is of the same order as the chess engine problem, in other words, what makes chess difficult is that its strategy involves the mathematical problem of prime factorization.

Observation 1: These conjectures are the result of 15 years of work on the theory of self-reproduction machines that John Von Neumann invented and that inspired 3 fields, computing, biology (through the discovery of DNA that Watson and Crick knew to look for because of the theory of the machines of own reproduction) and the theory of games. His method of inventing entirely new mathematical fields was to study nature, evolution, and the human nervous system. This is also the basis of my new discovery resulting from the analysis of energy in the work done by cells in the human body as a result of cellular self-replication in the human nervous system, which has tended to show that it is possible to make a game exponential in energy for computing purposes by understanding the computational power of the human nervous system from a theoretical physical perspective.

Observation 2: The purpose of my question is not an attempt to post any results, I will shortly do so on a new website that I own for this purpose, my question is that I need the help of an expert because I am getting over my head, so, what should I do?

Observation 3: I also invented the Math Inspector and I have a math education channel on youtube and it recently appeared on Mathologer. https://mathinspector.com/

Observation 4: If these types of questions are not appropriate, please let me know and I will stop on request. If you are on the topic please let me know and I will remove comment 4