{"id":816,"date":"2009-10-28T11:25:32","date_gmt":"2009-10-28T11:25:32","guid":{"rendered":"http:\/\/scientopia.org\/blogs\/goodmath\/2009\/10\/28\/the-hallmarks-of-crackpottery-part-1-two-comments\/"},"modified":"2009-10-28T11:25:32","modified_gmt":"2009-10-28T11:25:32","slug":"the-hallmarks-of-crackpottery-part-1-two-comments","status":"publish","type":"post","link":"http:\/\/www.goodmath.org\/blog\/2009\/10\/28\/the-hallmarks-of-crackpottery-part-1-two-comments\/","title":{"rendered":"The Hallmarks of Crackpottery, Part 1: Two Comments"},"content":{"rendered":"<p> Another chaos theory post is in progress. But while I was working on it, a couple of<br \/>\ncomments arrived on some old posts. In general, I&#8217;d reply on those posts if I thought<br \/>\nit was worth it. But the two comments are interesting not because they actually lend<br \/>\nanything to the discussion to which they are attached, but because they are perfect<br \/>\ndemonstrations of two of the most common forms of crackpottery &#8211; what I call the<br \/>\n&#8220;Education? I don&#8217;t need no stinkin&#8217; education&#8221;  school, and the &#8220;I&#8217;m so smart that I don&#8217;t<br \/>\neven need to read your arguments&#8221; school.<\/p>\n<p><!--more--><\/p>\n<p> Let&#8217;s start with the willful ignorance. This is the kind of crackpottery<br \/>\nthat frankly bugs me most. As an American, I&#8217;m used to the fact that our<br \/>\nculture distrusts intelligence and education. Politicians in America use<br \/>\n&#8220;intellectual&#8221; as a insult. Mentioning that someone attended one of the best<br \/>\nschools in America is commonly used as a criticism. That&#8217;s where this one, by<br \/>\na guy who calls himself &#8220;Vorlath&#8221;, comes from. Enough introduction, <a href=\"http:\/\/scienceblogs.com\/goodmath\/2009\/10\/sorry_denise_-_but_god_didnt_m.php#comment-2022628\">here<br \/>\nit is<\/a>:<\/p>\n<blockquote><p>\nI can&#8217;t believe there are still people who believe in Cantor&#8217;s<br \/>\ntheory. It&#8217;s complete silliness and makes the people who believe in<br \/>\nsuperstition look like the smart ones by comparison. Cantor was well known to<br \/>\ntreat infinity as a finite number and that&#8217;s all he&#8217;s doing with his theory.<br \/>\nIt doesn&#8217;t mean anything.\n<\/p><\/blockquote>\n<p> That argument reduces, roughly, to &#8220;I have no idea what Cantor&#8217;s argument was,<br \/>\nbut I don&#8217;t like it, and therefore it&#8217;s wrong&#8221;.<\/p>\n<p> Cantor didn&#8217;t treat infinity like a finite number. What he did was study the<br \/>\nstructure of numbers, and realize that &#8220;infinity&#8221; isn&#8217;t a simple thing. You can show<br \/>\nthat there are &#8220;infinities&#8221; that are larger than other &#8220;infinities&#8221;. In fact, it&#8217;s<br \/>\npretty inescapable.<\/p>\n<p> The rough sketch is: take any set, S. You can create another set, called the <em>power set<\/em> of S<br \/>\n(usually written 2<sup>S<\/sup>), which consists of the set of all subsets of S. So if S is<br \/>\nthe empty set, then 2<sup>S<\/sup> has one value: the set containing the empty set. If S<br \/>\nis the set { a, b }, then 2<sup>S<\/sup> = { {}, {a}, {b}, {a,b} }. The power set of any set S is<br \/>\n<em>always<\/em> larger than S. So &#8211; take the set of all natural numbers. How big is it? Well,<br \/>\nit&#8217;s infinite. How big is its powerset? It&#8217;s also infinite. But every powerset <em>must<\/em> be<br \/>\nbigger than the original set &#8211; so the powerset of the natural numbers must be larger<br \/>\nthan the natural numbers. How can that be? It can be, because there are different kinds<br \/>\nof infinities.<\/p>\n<p> Some of that actually has an effect in reality. I can create a perfect one<br \/>\nto one mapping between the natural numbers, and the set of all rational<br \/>\nnumbers. They&#8217;re the same size. But I <em>can&#8217;t<\/em> do that for real numbers. My<br \/>\nmapping for the rationals won&#8217;t include &pi;, unless I cheat and specifically add it<br \/>\nto the list. It won&#8217;t include square roots. No matter what I do, I can&#8217;t devise any<br \/>\nmethod for creating a one-to-one correspondence between the natural numbers and the real<br \/>\nnumbers. <em>That<\/em> is what Cantor&#8217;s work really showed.<\/p>\n<p> Intuitively, it seems <em>wrong<\/em> that there are degrees of infinity, that there<br \/>\nare bigger infinities and smaller infinities. The argument from Vorlath is, basically,<br \/>\nthat the fact that it&#8217;s not intuitive means that it <em>must<\/em> be wrong. Vorlath has<br \/>\nno need to know what Cantor really said, or what it really means. Without knowing that,<br \/>\nhe just <em>knows<\/em> it&#8217;s wrong, because it&#8217;s <em>obviously<\/em> silly.<\/p>\n<p> Moving on, we come to the genius who doesn&#8217;t need to know an argument in<br \/>\norder to disprove it. This is an amazingly common form of argument. I see it<br \/>\nmostly in the form of Cantor disproofs, where it takes the form &#8220;Here&#8217;s a<br \/>\none-to-one mapping between the natural numbers and the reals&#8221;. The mappings<br \/>\nare always wrong. But what makes the argument particularly annoying is that<br \/>\nthe mappings are <em>trivially<\/em> wrong: Cantor&#8217;s diagonalization shows that<br \/>\ngiven <em>any<\/em> one-to-one mapping between the naturals and the reals, the<br \/>\nmapping will miss some real numbers. In <em>every<\/em> case where I&#8217;ve seen<br \/>\none of these arguments, their enumerated mapping fails because Cantor&#8217;s<br \/>\ndiagonalization shows how to produce a counterexample for it. You can&#8217;t disprove<br \/>\nCantor&#8217;s diagonalization without showing that something is wrong with the<br \/>\ndiagonalization proof &#8211; but these anti-Cantor geniuses constantly think that<br \/>\nthey can disprove Cantor without actually addressing the proof.<\/p>\n<p> This comment though, has nothing to do with Cantor. It&#8217;s on<br \/>\nthe subject of iterative compression. <a href=\"http:\/\/scientopia.org\/blogs\/goodmath\/2009\/03\/i-get-mail-iterative-compression#comment-2025697\">Here<br \/>\nit is<\/a>:<\/p>\n<blockquote><p>\nYour talking linear maths not non-linear with non-linear representation you<br \/>\ncan compress repeatedly because the input a is different to the output b which<br \/>\nyou can then consider B in linear form ready to become non-linear C I know it<br \/>\ncan be done as I have the non-linear twin bifurcation maths needed and have<br \/>\ntested it already on random digit data and yes you can unpack this information<br \/>\ntoo. not to worry I&#8217;m am just getting ready to produce the compressor myself<br \/>\nand no I&#8217;m not a Christian. There of course for a given data set will be<br \/>\nlimits as to how compressed you can make the data but this will not be<br \/>\nrelative to linear laws of data compression.\n<\/p><\/blockquote>\n<p> This is, basically, the same thing as the Cantor disproofs. The argument<br \/>\nagainst iterative compression is pretty simple: compression is intrinsically<br \/>\nlimited &#8211; because <em>most<\/em> strings are non-compressible. It doesn&#8217;t<br \/>\nmatter how clever you are. <\/p>\n<p> The argument is incredibly simple. Imagine that you want to compress all<br \/>\nstrings of 128 bits. You&#8217;re not very ambitious: you only want to compress them<br \/>\nby <em>one bit<\/em> &#8211; to reduce all of those strings of 128 bits to 127<br \/>\nbits.<\/p>\n<p> You <em>can&#8217;t<\/em> do it.<\/p>\n<p> There are 2<sup>128<\/sup> strings of 128 bits, and 2<sup>127<\/sup> strings<br \/>\nof 127 bits. That means that either: (1) you can&#8217;t compress half of the strings,<br \/>\nor (2) on average, every 127 bit string is the compressed form of <em>two<\/em><br \/>\n128 bit strings. In case 1, you&#8217;ve admitted defeat: you can&#8217;t compress half of<br \/>\nthe strings <em>at all<\/em>. In case 2, you&#8217;re screwed, because compression is<br \/>\nonly valuable if it&#8217;s reversible &#8211; that is, when you compress a string, you<br \/>\nexpect to be able to get the original uncompressed string back; but if<br \/>\nthere are multiple input strings that can be mapped to the same compressed<br \/>\nstring, then your decompressor can only, at best, return a <em>set<\/em> of<br \/>\nstrings saying &#8220;The uncompressed string is one of these&#8221;.<\/p>\n<p> The more you compress, the worse it gets. Want to compress things by half?<br \/>\nThen you&#8217;re talking about compressing 2<sup>N<\/sup> strings into<br \/>\n2<sup>n\/2<\/sup> values &#8211; giving you 2<sup>n\/2<\/sup> possible uncompressed<br \/>\nvalues for each compressed string.<\/p>\n<p> The way that this relates to iterative compression is that an iterative<br \/>\ncompression system is no different than any other. Sure, you can devise<br \/>\niterative compression systems &#8211; they&#8217;re commonly known as &#8220;lousy compressors&#8221;.<br \/>\nWhat they do is take some specific set of input strings, and compress them a<br \/>\nlittle bit. Then you run them again, and they compress a little bit more. Then<br \/>\nyou run them again, and they compress a little bit more. Until eventually,<br \/>\nthey stop working. And, at best, you&#8217;ve compressed your input as much as you<br \/>\ncould have in a single pass with a non-iterative compression system.<\/p>\n<p> The unavoidable fact is that the set of inputs is larger than the set of<br \/>\noutputs, and that means that compression is inevitably limited. The reason<br \/>\nthat compression works <em>in practice<\/em> is because our input strings are<br \/>\nhighly structured &#8211; and in this case, structure is another word for<br \/>\n&#8220;redundancy&#8221;. We can compress text because text is far from random &#8211; it<br \/>\nhas redundant structure that we can remove. (For example, in the format<br \/>\nthat I&#8217;m using to write this post, each letter takes 8 bits. But I&#8217;m using<br \/>\na character set of about 64 characters. So really, even ignoring all of<br \/>\nthe redundancy of english, I&#8217;m using 8 bits per character when I could<br \/>\nbe using only 6. Fully 1\/4 of the length of this document is completely<br \/>\nredundant. And that doesn&#8217;t even cover the fact that I use words like &#8220;that&#8221; all<br \/>\nthe time &#8211; 41 times so far in this document, and each one takes 32 bits.)<\/p>\n<p> The problem with compression has <em>nothing<\/em> to do with linearity<br \/>\nversus non-linearity. It doesn&#8217;t matter how clever you are. If you can&#8217;t<br \/>\nexplain just how you&#8217;re going to compress 2<sup>N<\/sup> strings into<br \/>\n2<sup>N-1<\/sup> strings without losing any information, then <em>you<br \/>\nlose<\/em>: it can&#8217;t work. You haven&#8217;t addressed the problem.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Another chaos theory post is in progress. But while I was working on it, a couple of comments arrived on some old posts. In general, I&#8217;d reply on those posts if I thought it was worth it. But the two comments are interesting not because they actually lend anything to the discussion to which they [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[73,11],"tags":[],"class_list":["post-816","post","type-post","status-publish","format-standard","hentry","category-bad-logic","category-cantor-crankery"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p4lzZS-da","jetpack_sharing_enabled":true,"jetpack_likes_enabled":true,"_links":{"self":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/816","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/comments?post=816"}],"version-history":[{"count":0,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/816\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/media?parent=816"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/categories?post=816"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/tags?post=816"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}