flat assembler
Message board for the users of flat assembler.
Index
> Heap > Numerical oddities Goto page Previous 1, 2, 3 ... , 24, 25, 26 Next 
Author 

YONG
tthsqe wrote: yong  the roots of the general quintic can be described by formulas. See section 8.2 in http://math.uiuc.edu/~schult25/ModFormNotes.pdf. There is one obvious and trivial typo in the statement of Proposition 8.3.1, but other than that, it looks correct. Could you please show us the relevant formulas directly? The link you provided does not seem to work: "Page not found Our webserver cannot find the page you requested. Please check the URL to ensure the path is correct and that the URL is spelled correctly. The page you are looking for may have been removed or moved to a different location. Please go to our homepage to find the new location. If you still can't find what you are looking for, or to report a broken link, please contact the webmaster." Besides, please take a look at the following theorem: Abel–Ruffini theorem https://en.wikipedia.org/wiki/Abel%E2%80%93Ruffini_theorem I sincerely hope that you are actually correct on this matter. 

11 Aug 2015, 03:48 

revolution
The URL has an errant trailing dot.


11 Aug 2015, 04:05 

YONG
What MHajduk said actually answers revolution's original question.
The language that we are supposed/allowed to use dictates what numbers are indescribable. Unless the language set is welldefined, it is pointless to ask what numbers are indescribable. So, let's see if revolution can give us a welldefined language set to work with. 

11 Aug 2015, 10:05 

revolution
YONG wrote: So, let's see if revolution can give us a welldefined language set to work with. 

11 Aug 2015, 12:36 

MHajduk
revolution wrote: So how about this: In any language of your choosing, give an example of an indescribable number. Suppose, that I could give you an example of indescribable number. To point precisely this number among other indescribable numbers I should give you a definition of it, i.e. describe the features that identify exactly that number and no other indescribable number has got. But this way I will create using a finite number of symbols a description of it or better if you wish, I'll give you a finitely describable algorithm that will produce numeric representation of this number (as it was in the article mentioned by you). But in this case our number will automatically fall out of the set of indescribable numbers. How could I show you an example of indescribable number without describing it? 

11 Aug 2015, 16:03 

sleepsleep
revolution wrote: Can someone please give me an example of an indescribable number? check quoted below Quote: 

11 Aug 2015, 17:00 

revolution
MHajduk wrote:
sleepsleep wrote: check quoted below 

11 Aug 2015, 19:13 

l_inc
revolution
Just read the topic and learned about the indescribable numbers. Interesting thing is that indescribable numbers can be described... at least once. The point is to go beyond the scope of a language and use the surrounding world for a description. An example of that: take two coins and drop the first one so that it hits the ground, then drop the second one so that it also hits the ground. The time interval in seconds between the two hits is an indescribable number, but the very experiment is its description. The assumption here is that the time is continuous. I'd like to comment on my "at least once" above. Again, interesting thing is that the same experiment can be repeated to try to describe the same number, but the probability of describing the same number is zero (to be read as "almost certainly won't happen"). Nonetheless, events with zero probability (just like the outcome of the first experiment) happen all the time. _________________ Faith is a superposition of knowledge and fallacy 

11 Aug 2015, 20:59 

revolution
l_inc wrote: Just read the topic and learned about the indescribable numbers. Interesting thing is that indescribable numbers can be described... at least once. The point is to go beyond the scope of a language and use the surrounding world for a description. An example of that: take two coins and drop the first one so that it hits the ground, then drop the second one so that it also hits the ground. The time interval in seconds between the two hits is an indescribable number, but the very experiment is its description. The assumption here is that the time is continuous. 

12 Aug 2015, 00:51 

tthsqe
Yong  I have given you the relevant theory (without the trailing period). If you want the actual formulas, they are attached in this mathematica notebook. you might be able to open it in some browser plugin if you don't have the mathematica program.


12 Aug 2015, 01:40 

YONG
@tthsqe: I could access the pdf document of your link, and thank you for the mathematica program. But actually I do not have or need the program. If I ever want to find any of the real roots of a given quintic equation, I would rather use Newton's method, which is easytounderstand, fast, and most importantly, does not require programming.


12 Aug 2015, 05:39 

YONG
MHajduk wrote: How could I show you an example of indescribable number without describing it? We CAN describe, in English, what indescribable numbers we are after. For example, we are after the roots of a general quintic equation with rational coefficients. However, in a mathematical language of our choosing, we CANNOT state the exact values of such roots. For example, we cannot state, IN TERMS OF RADICALS, the exact values of the roots of a general quintic equation with rational coefficients. This makes the numbers we are after indescribable. Would this make sense? 

12 Aug 2015, 05:49 

MHajduk
YONG wrote: For example, we are after the roots of a general quintic equation with rational coefficients. YONG wrote: For example, we cannot state, IN TERMS OF RADICALS, the exact values of the roots of a general quintic equation with rational coefficients. 

13 Aug 2015, 04:46 

YONG
MHajduk wrote: But the Newton's method, you have mentioned above, is an example of finitely describable algorithm that allows to produce an infinite sequence of successively better approximations of those roots. Hence we have a method that allows us to produce successively digits of decimal representations of the roots and this is exactly what makes those numbers describable. "Assume that you(revolution) are(is) NOT talking about numerical approximations." Besides, if you have read the comments listed at the bottom of the original article (the one that talks about the computer programming approach), you would have noticed that some of the commenters do NOT agree with the author, especially on the point that "it does not matter even if the program runs infinitely and never stops". I take the same stance as those commenters. Finally, I am afraid that you missed the most important part of the argument: the numbers are indescribable in a language of our choosing. It seems that you have chosen ANOTHER language for MY indescribable numbers, making them describable. Hope that this clarifies your misunderstanding. 

13 Aug 2015, 05:22 

revolution
Is PI indescribable? No one can give every digit to infinite precision (it is proven irrational) or a closed form function (it is proven transcendental), but it is easy to state it as the ratio of circumference to diameter of a circle.


13 Aug 2015, 06:14 

YONG
revolution wrote: Is PI indescribable? No one can give every digit to infinite precision (it is proven irrational) or a closed form function (it is proven transcendental), but it is easy to state it as the ratio of circumference to diameter of a circle. If we regard "having a finitely describable algorithm (that produces an infinite sequence of successively better approximations)" the same as "having the number(s) describable", the answer is yes. Otherwise, it is debatable. 

13 Aug 2015, 06:43 

revolution
So your task is to give an example of an indescribable number in any language of your choosing. No cheating and using a different language to describe the number. Everything must be given in the chosen language.


13 Aug 2015, 06:47 

MHajduk
YONG
The fact that some numbers may not be expressed using the particular set of symbols and, at the same time, the same number may be expressed using another set of symbols is quite common and not especially interesting. I can give you a few examples of such numbers. Let A={0, 1} be the set consisting of only two symbols 0 and 1. Using these symbols you can represent any nonnegative integer treating strings made of 0's and 1's as binary representations of these numbers. But such simple set of symbols (accordingly to the convention) is not enough to build representation of all real numbers, i.e. accordingly to your definition, real noninteger numbers are "indescribable" in the context of alphabet A={0, 1} if we also want to represent all nonnegative integers with it. Now, let's take a new alphabet A'={0, 1, .} consisting of the symbols 0, 1 and dot that will be used to sygnalize the place where strings made of 0's and 1's are split into the integer part and mantissa. In this new alphabet you can already denote any nonnegative real number, so now you can't say that all noninteger numbers are indescribable in the context of the new alphabet A' as it was in the context of the old alphabet A. Another example refers to the wellknown problem of sections that may be constructed with use of a ruler and a compass. Lengths of such sections can be expressed as a superposition of four operations (addition, subtraction, multiplication and division) and calculation of the square root of the given number. The number being the real solution of the following equation x^3  2 = 0 i.e. the cube root of 2 is inexpressible in terms of the four arithmetic operations and taking the square root. BTW, it's the main reason why the Delian problem (doubling the cube problem) is not solvable using only such simple tools as a ruler and a compass. From the other hand, the solution of the aforementioned equation is obviously describable in terms of radicals (+, , *, / and nth roots where n is natural). Nevertheless, both examples presented above aren't the answers to the original question asked by revolution: revolution wrote: Can someone please give me an example of an indescribable number? 

13 Aug 2015, 20:08 

l_inc
revolution
Quote: I think first you would have to prove that time is not discrete. I don't have to prove it as long as I explicitly made it an assumption. Thus under the given assumption you have an example of an indescribable number. Quote: If time is discrete (Planck Time) Planck time by itself is inappropriate to mention here. It's just a value, not a time discontinuity hypothesis. _________________ Faith is a superposition of knowledge and fallacy 

13 Aug 2015, 23:20 

Goto page Previous 1, 2, 3 ... , 24, 25, 26 Next < Last Thread  Next Thread > 
Forum Rules:

Copyright © 19992020, Tomasz Grysztar.
Powered by rwasa.