Will still stick with this one
Did a little digging. Lot of mathematics involved

i don't do mathematics very well
If you can explain in words of two syllables with crayons it MIGHT help me understand
No math required.
In the 1920's people were wondering whether there was an "effective procedure," whatever that might mean, for solving certain problems in number theory. In other words given a problem of a certain type, was there an algorithm (our modern word for what they were thinking of) that would
terminate within a finite number of steps. That last requirement is a crucial part of the idea, since given a problem in number theory we can just try every possible integer if we are allowed infinitely many steps.
For example to see if there's an integer solution to the Fermat equation a^3 + b^3 = c^3, we could just try every possible combination of a, b, and c if we are allowed infinitely many steps. So the game is to try to:
* Define formally what we mean by an effective procedure; and
* Using that definition, determine whether there's an effective procedure to solve problems in number theory.
In 1936 Turing defined his idea of the Turing machine, showed that it's a reasonable definition of effective procedure, and showed that there were problems in number theory that could not be solved by any effective procedure. His work was strongly related to other work of the same era by
Gödel, Church, Post, and others.
It was soon proven that the approaches to defining effective procedures given by Turing, Post, and Church were equivalent. They said the exact same thing in different ways.
So now the question becomes: Is there any kind of computation or effective procedure that's NOT a TM? Something that we would recognize as a computation, but that is not reducible to a TM?
The Church-Turing thesis says that there is not such a thing. It says in effect that
any computation that can be done by a machine in the physical world is reducible to a TM.
In the 70 or 80 years since this thesis was proposed, no exception has been found. Quantum computers are reducible in principle to TMs, as are neural nets.
So when people say that the universe is a computation, the question is whether
a) It's reducible to a TM; or
b) It's a new type of computation that isn't reducible to a TM, thereby going beyond the Church-Turing thesis.
There's a third possibility:
c) The universe isn't a computation or machine at all. It's essentially random.
That's the question at issue. Because if the universe is a TM then so is the human mind. It's known that any TM can be implemented on any hardware. I can run a neural network on a supercomputer or I can execute it with pencil and paper and I'll get the same result. So if the universe and/or the mind are TMs, then they can be run in the wetware of the brain or in the digital logic of a computer or by a person using pencil and paper. You could indeed "upload" your mind to a digital computer. If a human could go crazy, so could a computer mind, because there would be no difference in principle between Microsoft Word and your mind. They're both reducible to Turing machines.
On the other hand if one claims (as I do) that the mind is NOT a TM, then I am claiming that whatever the mind is, it goes past the Church-Turing barrier to some new kind of computation; or else it's essentially random and does not work according to any laws or rules at all.
(ps) I'll add that it's in the realm of randomness that I think the answer lies. We can easily go past the limitations of TMs by allowing various forms of infinitary computations. There's a large literature on this and the related idea of hypercomputation, which people have probably heard of.
All these ideas remain theoretical, because the universe can not, as far as we know, instantiate an actual infinity.
If we get a revolution in physics that allows the universe to instantiate even a single noncomputable real, then infinitary computations become practical and we may have a better explanation of mind. The next revolution in physics will concern the infinite. We'll figure out what is the meaning of transfinite numbers and how they relate to what the universe does. Analogous to the way non-Euclidean geometry seemed nutty in the 1840's, and turned out to be the actual geometry of our world by 1915. Cantor's crazy numbers will find physical applicability, leading to a revolution in the theory of computation; which will give us radical new explanations for the nature of the mind and of the world.