There was a thought related to this that I’ve been trying to untangle. Assuming the brain is computable, which seems to me to be quite a safe assumption, doesn’t that imply that all of mathematics should be able to be framed computationally? It seems obvious to me that there should be some algorithm that could create mathematics by organizing a stream of input data in some fashion. After all, there is a (presumably) computable subsystem of Earth that does that, namely the mathematics community.
That said, in what light are we to consider “incomputable” mathematics? It seems like this is drawing a meaningless distinction given the computable universe hypothesis. Perhaps it can be thought of as a sort of counterfactual reasoning? This certainly seems to be the case with, say, accelerated Turing machines, the counterfactual being “what if there were no universal speed cap?”
Apologies if I’m not making sense, I’ve been awake for quite a while.
The position that makes the most sense to me is that uncomputable mathematics exist in a platonic sense, we just happen to inhabit a part of the ultimate ensemble that appears computable, but (1) there’s a chance that our universe is actually uncomputable (or alternatively, we’re “simultaneously” in computable and uncomputable parts of the multiverse), and (2) we can use computable machinery to learn some facts about uncomputable math.
The alternative of saying that only computable math exists seems to imply that all of the work done on understanding uncomputable math (such as Turing degrees and the like) is merely a game of manipulating meaningless symbols. In other words, those mathematicians who think they are reasoning about uncomputable math are not actually doing anything meaningful. That is hard to swallow.
What do you mean by computable or uncomputable math? In one sense, all math is computable (you can enumerate all valid proofs in a formal system, even if it talks about something mind-bogglingly huge like Grothendieck universes). In another sense, all math is uncomputable (you can’t enumerate all true facts about the integers, never mind more complex stuff). Is there some well-defined third way of cashing out the concept?
I don’t have an answer for that, since I’m not proposing to make a distinction based on computable vs uncomputable math. But I think Juergen Schmidhuber has defended some version of “only computable math exists” on the everything-list, so you can try searching the archives there.
It seems like your conception is isomorphic to mine to the extent that the ultimate ensemble can be considered as a set of counterfactual (with respect to local physical law) universes. You’ll see below that I brought up Zeno machines, and noted that they seem to follow this paradigm. Does this seem accurate?
The alternative of saying that only computable math exists seems to imply that all of the work done on understanding uncomputable math (such as Turing degrees and the like) is merely a game of manipulating meaningless symbols. In other words, those mathematicians who think they are reasoning about uncomputable math are not actually doing anything meaningful. That is hard to swallow.
Even the most abstract symbol manipulation can turn out to be functionally equivalent to a more concrete mode of reasoning and hence be quite useful. It is still an exploration of some sort of algorithmic reasoning, and coming from the view that mathematics is something like the art of predicting the outcome of various manipulations of structured data, such abstract games are not totally invalid.
My intuition is currently along the lines of thinking that uncomputable mathematics is disguised computable math, since the manipulation and creation of the system itself is computable (again, given the assumption that the human mind is computable), and so it is perfectly valid but misinterpreted in some sense.
I feel that I should say that my primary motivation for this line of thought is a desire to think about how a machine might create mathematics from scratch. I’ve started reading Simon Colton’s work, it seems quite interesting. Perhaps you could offer some insight into this sort of issue?
Talking or reasoning about the uncomputable isn’t the same as “computing” the uncomputable. The first may very well be computable while the second obviously isn’t.
Talking or reasoning about the uncomputable isn’t the same as “computing” the uncomputable.
Obviously, but I didn’t mean to imply that it was. My question is what we are actually reasoning about when we are reasoning about the uncomputable. Apologies if this wasn’t clear.
It seems to me that oracle computations and accelerated Turing machines, seem to be related to counterfactual reasoning in the sense that they suppose things that are not the case such as Galilean velocity addition or that we can obtain the result of a non-halting computation in finite time and use that to compute further results.
You may have heard of Chaitin’s constant, an uncomputable number. It’s easy to define the number, but it’s impossible for machines or people to compute it: For every person, there is a number N such that that person will never be able to figure out what the Nth digit of Chaitin’s constant is. I hope this helps.
Well, as I understand it Chaitin numbers are computable with a Zeno machine or an oracle machine with a halting oracle as they are Delta_20 in the arithmetic hierarchy. This still seems to follow my previous line of thinking; that reasoning about incomputable mathematics is itself computable (of course), but (more interestingly) can be framed as reasoning with counterfactuals about physical law (what if I could break the speed of light, in this case).
I would also note that the reals would be countable if it weren’t for incomputable numbers. Any number that can be approximated to an arbitrary degree by an algorithm can of course be represented by that algorithm, and thus the set of all such numbers is equivalent to a subset of Turing machines, which are countable.
All this considered, I’m not really sure how Chaitin’s constant (at least, in particular, beyond the fact that it is incomputable) bears on the issue.
There was a thought related to this that I’ve been trying to untangle. Assuming the brain is computable, which seems to me to be quite a safe assumption, doesn’t that imply that all of mathematics should be able to be framed computationally? It seems obvious to me that there should be some algorithm that could create mathematics by organizing a stream of input data in some fashion. After all, there is a (presumably) computable subsystem of Earth that does that, namely the mathematics community.
That said, in what light are we to consider “incomputable” mathematics? It seems like this is drawing a meaningless distinction given the computable universe hypothesis. Perhaps it can be thought of as a sort of counterfactual reasoning? This certainly seems to be the case with, say, accelerated Turing machines, the counterfactual being “what if there were no universal speed cap?”
Apologies if I’m not making sense, I’ve been awake for quite a while.
The position that makes the most sense to me is that uncomputable mathematics exist in a platonic sense, we just happen to inhabit a part of the ultimate ensemble that appears computable, but (1) there’s a chance that our universe is actually uncomputable (or alternatively, we’re “simultaneously” in computable and uncomputable parts of the multiverse), and (2) we can use computable machinery to learn some facts about uncomputable math.
The alternative of saying that only computable math exists seems to imply that all of the work done on understanding uncomputable math (such as Turing degrees and the like) is merely a game of manipulating meaningless symbols. In other words, those mathematicians who think they are reasoning about uncomputable math are not actually doing anything meaningful. That is hard to swallow.
What do you mean by computable or uncomputable math? In one sense, all math is computable (you can enumerate all valid proofs in a formal system, even if it talks about something mind-bogglingly huge like Grothendieck universes). In another sense, all math is uncomputable (you can’t enumerate all true facts about the integers, never mind more complex stuff). Is there some well-defined third way of cashing out the concept?
I don’t have an answer for that, since I’m not proposing to make a distinction based on computable vs uncomputable math. But I think Juergen Schmidhuber has defended some version of “only computable math exists” on the everything-list, so you can try searching the archives there.
It seems like your conception is isomorphic to mine to the extent that the ultimate ensemble can be considered as a set of counterfactual (with respect to local physical law) universes. You’ll see below that I brought up Zeno machines, and noted that they seem to follow this paradigm. Does this seem accurate?
Even the most abstract symbol manipulation can turn out to be functionally equivalent to a more concrete mode of reasoning and hence be quite useful. It is still an exploration of some sort of algorithmic reasoning, and coming from the view that mathematics is something like the art of predicting the outcome of various manipulations of structured data, such abstract games are not totally invalid.
My intuition is currently along the lines of thinking that uncomputable mathematics is disguised computable math, since the manipulation and creation of the system itself is computable (again, given the assumption that the human mind is computable), and so it is perfectly valid but misinterpreted in some sense.
I feel that I should say that my primary motivation for this line of thought is a desire to think about how a machine might create mathematics from scratch. I’ve started reading Simon Colton’s work, it seems quite interesting. Perhaps you could offer some insight into this sort of issue?
Talking or reasoning about the uncomputable isn’t the same as “computing” the uncomputable. The first may very well be computable while the second obviously isn’t.
Obviously, but I didn’t mean to imply that it was. My question is what we are actually reasoning about when we are reasoning about the uncomputable. Apologies if this wasn’t clear.
It seems to me that oracle computations and accelerated Turing machines, seem to be related to counterfactual reasoning in the sense that they suppose things that are not the case such as Galilean velocity addition or that we can obtain the result of a non-halting computation in finite time and use that to compute further results.
You may have heard of Chaitin’s constant, an uncomputable number. It’s easy to define the number, but it’s impossible for machines or people to compute it: For every person, there is a number N such that that person will never be able to figure out what the Nth digit of Chaitin’s constant is. I hope this helps.
Well, as I understand it Chaitin numbers are computable with a Zeno machine or an oracle machine with a halting oracle as they are Delta_20 in the arithmetic hierarchy. This still seems to follow my previous line of thinking; that reasoning about incomputable mathematics is itself computable (of course), but (more interestingly) can be framed as reasoning with counterfactuals about physical law (what if I could break the speed of light, in this case).
I would also note that the reals would be countable if it weren’t for incomputable numbers. Any number that can be approximated to an arbitrary degree by an algorithm can of course be represented by that algorithm, and thus the set of all such numbers is equivalent to a subset of Turing machines, which are countable.
All this considered, I’m not really sure how Chaitin’s constant (at least, in particular, beyond the fact that it is incomputable) bears on the issue.
I think I was confused about what you were confused about.