CodeProject Latest postings for Theraot
http://www.codeproject.com
Latest postings for Theraot from CodeProjecten-usCodeProject Latest postings for Theraothttp://www.codeproject.com/App_Themes/Std/Img/logo100x30.gif
http://www.codeproject.com
10030CodeProjectCopyright CodeProject, 1999-2014Webmaster@codeproject.com (Webmaster)Sun, 27 Jan 2013 07:48:00 GMT20C# Hand-coded goodnessInfinity and paradoxCantor also proved that the number of real integers is equal to the number of naturals, but it's smaller than the number of reals, the demostration is here: <a href="http://en.wikipedia.org/wiki/Cantor's_diagonal_argument">http://en.wikipedia.org/wiki/Cantor's_diagonal_argument</a>[<a href="http://en.wikipedia.org/wiki/Cantor's_diagonal_argument" target="_blank" title="New Window">^</a>]Also the first Hilbert problem (of his 23 famous set) is whatever or not exists a transfinite number in between the number of integers and the number of reals. This problem is considered solved, but the answer is "it depends...". It depends on the axioms in which you base the number theory (that has to do with gödel's work), but for the street walking people, no there is not.<br />
<br />
paradoxes and infinite, this is my favorite:<br />
<br />
paradoxes and infinite, this is my favorite: Say you have the list of all possible words wrote in any given language with a finite set of symbols. Now you sort them by it's length, starting by the language defined by 0 characters, and then those with a single symbol,then those with two, and so on. Now you can define a language by saying whatever or not, it contains any given word in the list, that way the language is represented by a sequence of bits, being 1 = it has the word, and 0 = it hasn't the word. Now Let's say we have the list of definition of all possible languages. Each definition is also a sentence wrote in an standard language (BNF, English, Binary, C#, you say... I'll take English), again you sort the list, and you can give each of then a natural number (1, 2, 3...). Now you pair the definition with the binary sequence of the language.<br />
<br />
The next step is to use the Cantor diagonal argument: you define a language that differs in the Nth bit to the Nth language. So you get a language that is proven that is not in the list, so you has the proof that there are more languages than natural number, that's not a paradox. But you can define that language that's not in the set with a finite number of symbols in your standard language, In fact I just defined it above in English, and it took me a finite sentence to do it, so it should be in the list, that's the paradox, it should be, but it isn't.<br />
<br />
I'll extract the definition in a more formal way: "The language that differs in the Nth bit to the Nth language in the list of all language that uses English alphabet, sorted by the length of it's definition wrote in English, where each bit says whatever or not the language contains the word that is in the position of the bit in the list of all possible words that can be wrote with English alphabet sorted by it's length"<br />
<br />
--------<br />
I found the above paradox in a book, I don't remember which book, neither the exact text. What is above is a reconstruction from my understanding of the paradox. Anyway, I've learned that this paradox is a variation of <a href="https://en.wikipedia.org/wiki/Kleene%E2%80%93Rosser_paradox">Kleene–Rosser paradox</a>[<a href="https://en.wikipedia.org/wiki/Kleene%E2%80%93Rosser_paradox" target="_blank" title="New Window">^</a>] and that one is in turn based on <a href="https://en.wikipedia.org/wiki/Richard_paradox">Richard's paradox</a>[<a href="https://en.wikipedia.org/wiki/Richard_paradox" target="_blank" title="New Window">^</a>].<br />
<div class="signature"><div class="modified">modified on Friday, November 5, 2010 3:40 PM</div></div>
http://www.codeproject.com/Messages/3322477/Infinity-and-paradox.aspx
TheraotTue, 05 Jan 2010 17:00:00 GMTTheraot