Fine, name one. All you have is an existence proof; and an existence proof is a weaker class of metaphysical existence than a constructive proof like showing that 2/3 or pi exists. — fishfry
What do you mean? Any point on the well-known number line exist in the same metaphysical sense as another point. There's e and there's pi and there's a non-computable irrational number between them which is a point on the number line. Are you saying some points on the number line are different from other points on the number line? If yes, never heard that before but that's probably just me. Care to clarify your metaphysical objection?
I'm afraid I didn't follow your algorithm at all — fishfry
The algorithm I posted is just something that popped into my mind and isn't one that's ready for prime time as they say. What's the problem with it though? It's got only 4 instructions.
Let's go over it together.
Assume that a substitition-cipher-like process is involved and 0 is substitited with 9, 1 with 8, 2 with 7, 3 with 6 , and 4 with 5
1. The first step is to print a number n [e.g. 29]
2. The second step is to find how many digits n has, say it has d digits [d = 2]
3. The third step is to create a d digit number with all digits substituted/changed from n and assign it to n [n = 70 as 2 is replaced with 7, 0 is swapped with 9]
4. Go to 1
The first iteration of this algorithm using the examples I gave will print
2970
The second iteration would look like this:
29707029
The third iteration would look like this:
2970702970292970
The fourth iteration would like this :
29707029702929707029297029707029
Is there are
repetition in the sequence of digits? No. So, no pattern
Is the sequence
random?
This is a difficult question for me to answer but here's what I think:
(i). If only four digits (0, 2, 7, 9) are being considered, the sequence is random as each digit appears the same number of times as the other digits, making their appearance in the sequence equiprobable (that's randomness right)
However,
(ii). If we consider all 10 digits available to us (0, 1, 2, 3, 4, 5, 6, 7, 8, 9), the digits are not random; only 0, 2, 7, 9 make an appearance
As I admitted at the outset, I'm neither a coder nor a mathematician so kindly cut me some slack.
But if you are generating a number from an algorithm, you haven't generated a noncomputable. — fishfry
If you notice the algorithm isn't mathematical. It's more like a cipher but I don't know whether that, in itself, suffices to make the output of the algorithm non-computable. It
is irrational thought as the digits are infinite and don't repeat.
There is an enumeration of the computable numbers; but there is no computable enumeration of the computable numbers! — fishfry
I found this on wikipedia:
While the set of real numbers is uncountable, the set of computable numbers is classically countable and thus almost all real numbers are not computable — wikipedia
:chin:
And either way, mathematical existence is not physical existence, A computer could put in our minds the idea of a flying horse, Captain Ahab, Captain Kirk, and noncomputable numbers. But since those things don't exist in the physical world, they are not evidence that the world is not a computer. — fishfry
I don't know to whom I said this to but I'll say it again for your benefit: E-V-E-R-Y-T-H-I-N-G is a simulation if reality is a simulation and that non-computable irrational numbers exist in some space (mental/platonic/mathematical, you decide), it must be accounted for in the code that creates the simulation.
Penrose's bad ideas are better than most people's good ones. — fishfry
:rofl: I'm voting for you if you ever contest elections! You should be president.
All that out of the way, I'd like to run something by you. I have this notion of infinite randomness in my mind. To me it means the existence of an infinity that is completely devoid of all patterns. If such infinite randomness were discovered to exist (I don't care as to where) can we infer the impossibility of reality being an illusion based on the premise that to code infinite randomness would require an infinite set of instructions, a task that can't be completed, and if so, such a code can't ever be actually executed?