Slashdot Mirror


44 Conjectures of Stephen Wolfram Disproved

Richard Pritches writes in to let us know that MIT errata expert Evangelos Georgiadis has disproved 44 conjectures set by Dr. Stephen Wolfram (founder of Mathematica) in A New Kind of Science. The paper was published in the latest issue of the Journal of Cellular Automata and can be read in PDF form at Prof Edwin Clark's collection of reviews of Wolfram's ANKS. "The formulas provided by Wolfram for these [44] rules are not minimal. Moreover for 8 of these cannot be minimal even by simple inspection since minimal formula sizes for 3-input Boolean functions over this basis never exceeds 5."

158 comments

  1. Slightly different boolean formula by Ed+Pegg · · Score: 2, Interesting

    That is a very inflammatory title. The page in question is: http://www.wolframscience.com/nksonline/page-884 Comparing the items in the paper to this page, there isn't much here.

    1. Re:Slightly different boolean formula by gzipped_tar · · Score: 3, Insightful

      Yes the difference are "slight"...

      but according to Georgiadis's paper, they're different in nature. Wolfram guess they're 'minimal' in size (plz see the Georgiadis paper for the exact definition) but they are discovered not to be so.

      I'm not one in the circle of CA and I don't understand all the significance about these arguments. But I don't think disproving some conjectures are "inflammatory" in mathematics. It seems some people are not satisfied with Wolfram's style (e.g. his failure in acknowledgin/interpreting other people's researches), but as for the FA it is essentially an objective argument about some mathematical facts.

      Correct me if I make a mistake.

      --
      Colorless green Cthulhu waits dreaming furiously.
    2. Re:Slightly different boolean formula by Nimey · · Score: 0, Troll

      That is a very inflammatory title. On Slashdot?. Never!
      --
      Hail Eris, full of mischief...

      E pluribus sanguinem
    3. Re:Slightly different boolean formula by Anonymous Coward · · Score: 0

      What's Zermelo-Fraenkel set theory that link mentions? And why does Wolfram seem to want to modify it. I thoguht it was supposed to be an axiom. I've had 2 years of university calc and partial Def EQs and i'm completely lost.

    4. Re:Slightly different boolean formula by theunderground-Check · · Score: 0

      U kiddin me? on slashdot nothing is. U must be from the Wolfram clan, then.

    5. Re:Slightly different boolean formula by jacquesm · · Score: 1

      Doesn't Wolfram have a stake in that journal ?

    6. Re:Slightly different boolean formula by Anonymous Coward · · Score: 0

      Luckily not yet. I bet he will after this though. Money can unfortunately nowadays. But go check it out, the Editor in Chief is amazing prof. Andrew Adamaztky. Hopefully, the editorial board will stay clean from Wolfram.

    7. Re:Slightly different boolean formula by poopdeville · · Score: 5, Informative

      Zermelo-Frankel Set Theory is an axiomatization of set theory. That is to say, it is a list of axioms describing properties of any structure that is meant to be a collection of sets. There are alternative structures and alternative axiomatizations to generate those structures. (FYI, a consequence of Godel's Incompleteness Theorem is that there are infinitely distinct (in a non-trivial sense) axiomatizations of the natural numbers.)

      Since you've studied Diff Eqs, I'll give you a little example of why axioms of this kind are needed. You were studying differentiable functions. Many of their properties are due to the completeness of the real numbers. Many of their properties are due the real numbers being ordered. Some are due to the fact that the real numbers form a field. And while tools like linear algebra might be necessary to study differential equations, all the properties of differentiable functions are caused by at least one of these three (and the definition of a differentiable function).

      It turns out the real numbers can be characterized as the complete ordered field. To axiomatize the real numbers -- to write sentences from which all the others follow -- we just have to group together the completeness axiom (Every Cauchy sequence converges in the set), the field axioms, and the order axioms. If, for example, you drop the completeness axiom, you would also be writing about things like the rational numbers since they're an ordered field that happens to not be complete.

      Axioms aren't about truth. They have a specific meaning in logic, and more importantly act as a sign post to the audience saying: this is what I'm going to talk about, and how I'm going to talk about it. Of course, in practice, mathematicians don't explicitly state these axioms unless they are the subject of the paper. But they are implicitly "contained" in the jargon.

      --
      After all, I am strangely colored.
    8. Re:Slightly different boolean formula by theunderground-Check · · Score: 1

      Luckily not yet and hopefully for the sake of science the editorial board of Journal of Cellular Automata will never allow this.

    9. Re:Slightly different boolean formula by 2.7182 · · Score: 3, Insightful

      Not to be a jerk or anything, but two years of calculus and a PDE course don't prepare you to understand all that much. In this case some course in logic and the theory of computation might be in order.

    10. Re:Slightly different boolean formula by Hoch · · Score: 1

      Completeness in the real numbers is not that every Cauchy sequence converges, it is that every set bounded above has an upper bound. That real Cauchy sequences converge follows from this property, but not the other way around. For an example take rational functions as your field with an order on their coefficients(ie 1x+1 > 1x > 1 > 1/x). Showing that cauchy sequences converge and that this not equivalent to the reader is left as an exercise to the reader.

      --
      2*31*37*263
    11. Re:Slightly different boolean formula by miskatonic+alumnus · · Score: 1

      Completeness in the real numbers is not that every Cauchy sequence converges, it is that every set bounded above has an upper bound.

      That should be "has a LEAST upper bound."

      That real Cauchy sequences converge follows from this property, but not the other way around.

      False. One way to construct the reals is to consider equivalence classes of Cauchy sequences of rationals. The reals constructed in this manner have the least upper bound property.

      For an example take rational functions as your field with an order on their coefficients(ie 1x+1 > 1x > 1 > 1/x). Showing that cauchy sequences converge and that this not equivalent to the reader is left as an exercise to the reader.

      What topology are you considering on this space of functions?

    12. Re:Slightly different boolean formula by poopdeville · · Score: 1

      Completeness in the real numbers is not that every Cauchy sequence converges, it is that every set bounded above has an upper bound.

      You mean a supremum, or least upper bound. Having just an upper bound is trivial, since every number is finite. The "axioms" happen to be equivalent.

      http://en.wikipedia.org/wiki/Complete_space
      http://www.mathology.net/mathology/vis_articolo.asp?id=44&lang=ita

      To prove that they are equivalent, note that there is a bijective correspondence between elements of convergent sequences and least upper bounds on finite sets. Use the face that the sequence is Cauchy.

      --
      After all, I am strangely colored.
    13. Re:Slightly different boolean formula by poopdeville · · Score: 1

      Better yet, an explicit proof. Assume that each bounded set has a least upper bound.

      First: the range of a Cauchy sequence is bounded.

      Pf/ Let {x_n} be a Cauchy sequence and epsilon > 0. Then there is an N such than m and m => N implies that d(x_m, x_n) epsilon. Since N is finite, there is a maximum pairwise distance between points whose indices are less than or equal to N, denoted max_{i,j=N} {d(x_i, x_j)}. Thus the maximum distance is max_{i,j=N} {d(x_i, x_j)} + epsilon.

      Second: dually to the condition that each bounded set has a least upper bound, each bounded set has a greatest lower bound.

      Third: Since {x_n} is bounded, d(x_i, x_j) is bounded as i and j vary. Thus the set has a greatest lower bound. Which is clearly 0 since the sequence is Cauchy.

      --
      After all, I am strangely colored.
    14. Re:Slightly different boolean formula by poopdeville · · Score: 1

      Typo: d(x_m, x_n) =< epsilon

      --
      After all, I am strangely colored.
    15. Re:Slightly different boolean formula by poopdeville · · Score: 1

      I messed up. Oh well.

      --
      After all, I am strangely colored.
    16. Re:Slightly different boolean formula by rpg25 · · Score: 1

      I confess to being a bit rusty on this subject, but isn't it the rationals that are a field? Or at the very least, you don't need to go to the reals to get a field, although they are a field...

    17. Re:Slightly different boolean formula by Anonymous Coward · · Score: 0

      That's what I meant. If you're talking about 'merely' ordered fields, you're talking about both the rationals and the reals, since they're both ordered fields. If you're talking about complete ordered fields, you're talking specifically about the reals, since the axioms describe a single structure instead of many.

    18. Re:Slightly different boolean formula by Hoch · · Score: 1

      Yea, I typoed out least. You are correct that one can construct the reals from cauchy sequences of rationals. I was pointing out that if one doesn't start with rationals as their field, he doesn't get reals. I think I left out a bit too much for it to have been clear. The space in question should be the space of (equivalence classes of) cauchy sequences of (equivalence classes of) rational functions. For the topology on the space of equivalence classes of rational functions, use the order topology (basis of open intervals). To determine order, use the same technique as for rationals, that is a/b > c/d iff a*d > c*b only applied to polynomials. The topology on the cauchy space is given by the limit. This satisfies the first 12 axioms for the reals, and cauchy sequences converge, but does not have the least upper bound property. If you want the punch line, 1/n converges to 0 and 01/n, but the set {1/n} has no greatest lower bound. 1/xx/x^2-1...1/n

      --
      2*31*37*263
    19. Re:Slightly different boolean formula by Anonymous Coward · · Score: 0

      The rationals and reals are both fields, but only the reals are a complete ordered field.

    20. Re:Slightly different boolean formula by miskatonic+alumnus · · Score: 1

      I'm not following you. Could you be more specific with the ordering of the rational functions? For example, using the notation (3,2,1) for 3+2x+x^2, how does (5,0,-7)/(4,2,13) compare to (-8,3)/(5,11,-2,9) ?

      Furthermore, what is an open interval for these functions? Are you talking about epsilon neighborhoods with respect to some metric?

    21. Re:Slightly different boolean formula by Hoch · · Score: 1

      an open interval (a,b) is the set of all numbers x where a -3x^2 > x > x - 1 > 1 ... now, a/b > c/d iff a*d > b*c.

      --
      2*31*37*263
    22. Re:Slightly different boolean formula by Jim+Starx · · Score: 1

      Yes the rationals are a field, in fact they're ordered too. That is why the field axioms and the order axioms are not enough to fully describe the reals. That is why you need the completeness property which is a property that the rationals do not have.

      --
      The darkness... controls the music. The music... controls the soul.
    23. Re:Slightly different boolean formula by Hoch · · Score: 1

      sorry about that, the html ate my post.
      an open interval (a,b) is the set of all numbers x where a < x < b.
      As to the order, first order the polynomials. This is done by degree, then coefficients 3x^2 > -3x^2 > x > x - 1 > 1 ...
      now, a/b > c/d iff a*d > b*c.

      --
      2*31*37*263
    24. Re:Slightly different boolean formula by mikiN · · Score: 1

      Time to bring MathML to Slash (and to the masses) :)

      --
      The Hacker's Guide To The Kernel: Don't panic()!
    25. Re:Slightly different boolean formula by poopdeville · · Score: 1
      If you want the punch line, 1/n converges to 0 and 01/n

      Limits are unique in metric spaces. So if it converges to 0, and it converges to (0*1)/n, you know they're the same: the rational function 0. The set of rational functions {1/n} has a greatest lower bound -- the rational function 0.

      I still don't see where you're going with this. The structure you described is either isomorphic to the real line, because of the real number axiom's categoricity, or the structure is not isomorphic because it's not totally ordered. I will admit that conventional language here is ambiguous. I meant a total order. If this is what your objection referred to, fine, I will agree that a merely partially ordered complete field is not isomorphic to the reals.

      Since this started your objection, note that:

      A complete metric is a metric in which every Cauchy sequence is convergent. A topological space with a complete metric is called a complete metric space.http://mathworld.wolfram.com/CompleteMetric.html

      --
      After all, I am strangely colored.
    26. Re:Slightly different boolean formula by miskatonic+alumnus · · Score: 1

      He's got a valid point. It is not sufficient to complete an ordered field via Cauchy sequences to get a structure isomorphic to the reals. In addition, the field must have the Archimedean property that for every x,y in the field, there exists a natural number n such that nx>y. This plus Cauchy complete is equivalent to Dedekind complete (least upper bound property). It is the Dedekind complete ordered fields that are isomorphic to the reals.

  2. English anyone?? by Racemaniac · · Score: 4, Funny

    "has disproving"
    is it that hard to write a summary without such huge errors??
    i'm not a native english speaker, and it even pokes out my eyes...

    1. Re:English anyone?? by Anonymous Coward · · Score: 0

      Glass houses and such.

    2. Re:English anyone?? by rxmd · · Score: 5, Funny

      "has disproving"
      is it that hard to write a summary without such huge errors??
      i'm not a native english speaker, and it even pokes out my eyes...
      You have assuming that the editors can reading!
      --
      As a state gets corrupt, its laws multiply; the most corrupt states have the most numerous laws. (Tacitus, Annales 3:27)
    3. Re:English anyone?? by evanbd · · Score: 4, Funny

      If your shift key is broken, it is permissible to use your caps lock key for the duration of the required capital letter. I know that key is abhorrent to most here, but it does have uses in the event a sudden failure of both shift keys.

    4. Re:English anyone?? by marcello_dl · · Score: 0, Redundant

      Let me disprove the usefulness of parent post for failure to assume laziness of GP poster.

      --
      ---- MISSING MISCELLANEOUS DATA SEGMENT --- [sigdash] trolololol
    5. Re:English anyone?? by nospam007 · · Score: 1

      If your shift key is broken, it is permissible to use your caps lock key for the
      duration of the required capital letter. I know that key is abhorrent to most here, but it does have uses in the event a sudden failure of both shift keys.
      ___

      On every new machine I get, first thing I do is siwtch off the capslock key and redirecting it to left-shift, I assume many people do the same, so we have 3 Shifts.

      BTW for the machine I got a few days ago I googled a nice utility which does it nicely, no registry hacks I never remember.
      So if you capslock your password entry more than once a day...
      http://www.randyrants.com/2006/07/sharpkeys_211.html

    6. Re:English anyone?? by rcw-home · · Score: 2, Funny

      "has disproving" is it that hard to write a summary without such huge errors??

      One word: havening.

    7. Re:English anyone?? by flyingfsck · · Score: 4, Funny

      Slashdot Engrish is to be informating and not to be laughful at.

      --
      Excuse me, but please get off my Pennisetum Clandestinum, eh!
    8. Re:English anyone?? by pthisis · · Score: 1

      On every new machine I get, first thing I do is siwtch off the capslock key and redirecting it to left-shift, I assume many people do the same, so we have 3 Shifts.

      What you map it to usually depends on your editor. Emacs users map it to ctrl, vi users map it to esc.

      (I've never heard of mapping shift before, and given that it's right next to a shift key that doesn't seem like a big help to me but if it helps you then do it!)'

      --
      rage, rage against the dying of the light
    9. Re:English anyone?? by nhaines · · Score: 0, Offtopic

      Actually, that was originally the location of Ctrl. I'm not sure why the changed it, but if I were to remap my CapsLock, it would definitely be to Ctrl.

      On the other hand, the OLPC XO-1 is mapped that way and I haven't become used to it yet... So for now I'll leave everything where it is until I can get a nice keyboard with generic keycaps (although I'd substitute a Tux icon for a "Super" label...).

    10. Re:English anyone?? by Sky+Cry · · Score: 4, Funny

      Surely you meaning righting, not reading!

    11. Re:English anyone?? by rm999 · · Score: 1

      Funny thing is, the sentence is about a person whose job (hobby?) is to look for errors in grammar.

      Look at his correction of this textbook:
      http://www-math.mit.edu/~sipser/itoc-errs2.1.html

    12. Re:English anyone?? by Anonymous Coward · · Score: 0

      What caps lock key? My keyboard doesn't have one of those. It has two left Control keys instead.

      (Yeah, I actually popped off the keycap and replaced it with a Control keycap from a spare keyboard, I'm that geeky.)

    13. Re:English anyone?? by Anonymous Coward · · Score: 0

      Me fail English? That's unpossable!

    14. Re:English anyone?? by OrangeTide · · Score: 1, Troll

      People on the internet are too busy typing to be bothered with reading.

      --
      “Common sense is not so common.” — Voltaire
    15. Re:English anyone?? by raddan · · Score: 1

      Actually, I think it was supposed to be "Can has disproving!"

    16. Re:English anyone?? by psu_whammy · · Score: 1

      Or, quit being a damn cheapskate and go pay 20 bucks for a keyboard!

      Oh, you're you on a laptop? Quit typing so damn hard!

    17. Re:English anyone?? by Phleg · · Score: 1

      i switched to colemak, you insensitive clod!

      --
      No comment.
    18. Re:English anyone?? by osu-neko · · Score: 1

      I do precisely that. Control key sequences, especially the vital Ctrl-S and Ctrl-Q, are much easier to type when you put the control key back where God intended it to be. ;)

      --
      "Convictions are more dangerous enemies of truth than lies."
    19. Re:English anyone?? by und0 · · Score: 1

      [...] especially the vital Ctrl-S and Ctrl-Q, are much easier to type when you put the control key back where God intended it to be. ;)

      Near your right pinkie? ^__^

    20. Re:English anyone?? by The+Famous+Druid · · Score: 1

      I think we have an answer to Gearge W Bush's famous question "Is our children learning?"

      No, they aren'ting.

      --
      Quidquid Latine dictum sit, altum videtur (anything said in Latin sounds important)
    21. Re:English anyone?? by Jugalator · · Score: 1

      "I has disproven you"

      ^-- sounds like something from a LOLCAT image... One of those particularly serious looking lolcats.

      --
      Beware: In C++, your friends can see your privates!
    22. Re:English anyone?? by 12357bd · · Score: 1

      You have assuming that the editors can reading!

      Where's the probleming?

      --
      What's in a sig?
    23. Re:English anyone?? by MynockGuano · · Score: 1

      I like Insert (vi user). It is especially handy for a Dvorak layout, where ctrl-C and ctrl-V are cumbersome. Using ctrl-ins and shift-ins for copy/paste with this layout is actually even MORE convenient.

    24. Re:English anyone?? by shutdown+-p+now · · Score: 1

      Oh, write, silly me.

  3. What happened to proofreading? by Token_Internet_Girl · · Score: 0

    Terrible grammatical errors in this. Yes I am the Grammar Nazi.

    --
    Sure baby, I'll give you my phone number...in Hex
    1. Re:What happened to proofreading? by RAMMS+EIN · · Score: 1, Troll

      Proofreading? On Slashdot? You must be new here!

      --
      Please correct me if I got my facts wrong.
    2. Re:What happened to proofreading? by Anonymous Coward · · Score: 0

      Can it be postulated that you are only a grammar Nazi after stating it is so? It's the only thing that will save you, given that your first "sentence" is actually a sentence fragment.

      Insufferable pedantry is at its most annoying when it comes from the mouth of a fool. Learn your shit and get some humility.

    3. Re:What happened to proofreading? by Anonymous Coward · · Score: 0

      Actually, no, that isn't a fragment. It is written as dialogue, the question marks are standing in the place of commas to better reflect the tone of voice. That is one of the rules that can be suspended when trying to write natural sounding dialogue.

      If you say it out loud, then say the same thing with commas instead, you'll see the point. The tone of voice is totally different, with longer pauses between the words than you would get with commas.

    4. Re:What happened to proofreading? by kayditty · · Score: 0
      Like anyone should take your advice on English grammar. Standing in the place of a comma? I suppose it should read: "What happened to proofreading, terrible grammatical errors in this."

      No matter; you made a similar error yourself.

      "It is written as dialogue, the question marks are standing in the place of commas to better reflect the tone of voice."

      What the hell does that mean? Oh, that's right. It was a comma splice.

      That is one of the rules that can be suspended when trying to write natural sounding dialogue.

      That is one of the rules WHICH [may] be suspended.

      If you say it out loud, then say the same thing with commas instead, you'll see the point.
      Can you says omething "with commas?"

      And the original poster should've said "Yes, I am a grammar nazi."
    5. Re:What happened to proofreading? by kestasjk · · Score: 1

      Im more interested in the mathematical errors being discussed than grammatical ones. Anyone got anything to say about these 44 conjectures or the guy who made them?

      --
      // MD_Update(&m,buf,j);
    6. Re:What happened to proofreading? by NoOneInParticular · · Score: 1

      It's actually fairly simple: Wolfram created a table with 256 logical formulae in them that modelled all possible 3 input boolean truth tables. He apparently conjectured that these were the shortest. The article corrects Wolfram in providing, for 44 of these cases, that there exists a shorter formula. Wolfram was apparently not smart enough to simply enumerate all the formulae until he found the shortest. Given the size of the search space this would have taken all of three seconds.

  4. Watch out for the roundhouse kick by Jah-Wren+Ryel · · Score: 5, Funny

    Doesn't Evangelos know that Wolfram is the Chuck Norris of Math?
    Nobody disproves Chuck Norris and lives to publish about it!

    --
    When information is power, privacy is freedom.
    1. Re:Watch out for the roundhouse kick by jargon82 · · Score: 1

      more minicity crap

    2. Re:Watch out for the roundhouse kick by Anonymous Coward · · Score: 0

      Hey! Don't ruin it for everyone else!!

    3. Re:Watch out for the roundhouse kick by Anonymous Coward · · Score: 0

      Chuck Norris is the Chuck Norris of Math.

  5. More info by the_kanzure · · Score: 3, Informative

    Tim's cellular automata FAQ may be of some help in understanding all of this.

  6. Can this 'Cellular Automata'.... by Anonymous Coward · · Score: 0

    run a beowulf cluster?

    *Beer. It's not just for breakfast anymore!

  7. !Clearly the lack of posts by peripatetic_bum · · Score: 0

    is directly proportional to the knowledge required to post

    --

    Sigs are dangerous coy things

    1. Re:!Clearly the lack of posts by Anonymous Coward · · Score: 0

      is directly proportional to the level of interest in this battle of the egos... no one gives a crap.

    2. Re:!Clearly the lack of posts by hung_himself · · Score: 4, Insightful

      is directly proportional to the perceived knowledge required to post.

      You must be new around here. When it comes to biology, everyone seems to think they are experts. Because there are so many computer people here, at least when it comes to math, more of them know that they know nothing...

    3. Re:!Clearly the lack of posts by Anonymous Coward · · Score: 0

      I find it humorous that you, who have a higher UID, have the audacity to assert that the OP is "new" to /.

    4. Re:!Clearly the lack of posts by Anonymous Coward · · Score: 0

      You must be new here.

    5. Re:!Clearly the lack of posts by crosson · · Score: 1

      Every knows that biology is weak, and Math is strong.

    6. Re:!Clearly the lack of posts by zanaxagoras · · Score: 1

      Every knows that biology is weak, and Math is strong. Don't know who this Every person might be, but he/she is utterly wrong...
    7. Re:!Clearly the lack of posts by The+One+and+Only · · Score: 1

      Clearly he's on a first name basis with Every One. This is good for him since as they say, you have to pretty much know Every One to get ahead in this world. On the other hand, when I ask who truly understands any complicated subject, the response is always "not Every One". Truly, like so many of our leaders, this Every One character is simply an influential dullard.

      --
      In Repressive Burma, it's not just your connection that dies. slashdot.org/comments.pl?sid=314547&cid=20819199
  8. Re:Humm... by Omnifarious · · Score: 5, Interesting

    Ahh, yes. But the great thing about math is that whether or not you have a grudge, everybody can look at the proof and see if you're right or not.

    Personally, if I were a mathemetician, I might have something of a grudge against Stephen Wolfram too. An arrogant person who hypes his own name and abilities far beyond what is justified by the available material then publishes a giant tome of half-baked reasoning that everybody fawns over because of his hyped reputation.

  9. I think I speak for a lot of people here ... by mortonda · · Score: 4, Insightful

    when I say...

    Huh?

    1. Re:I think I speak for a lot of people here ... by h2k1 · · Score: 1

      is there anyone out there willing to translate this post to dumb ass slashdoters?

    2. Re:I think I speak for a lot of people here ... by emurphy42 · · Score: 5, Informative

      As I understand it, it's basically an abstract-logic equivalent of a Perl golf exercise.

      Given three Boolean variables (p,q,r), there are 2 possible values (T,F) per variable, thus 2^3 = 8 possible values for the combined set:

      1. T,T,T
      2. T,T,F
      3. T,F,T
      4. T,F,F
      5. F,T,T
      6. F,T,F
      7. F,F,T
      8. F,F,F

      Now consider functions f(p,q,r) whose output is a Boolean variable. Each such function can be completely described by what output it produces for each of the 8 combinations listed above, e.g.

      • f(T,T,T) = F
      • f(T,T,F) = F
      • f(T,F,T) = F
      • f(T,F,F) = F
      • f(F,T,T) = F
      • f(F,T,F) = F
      • f(F,F,T) = T
      • f(F,F,F) = F

      There are multiple ways to describe the above function, but they're all equivalent to each other because they all give the same results. Thus, there are exactly 2^8 = 256 distinct functions of this sort.

      Wolfram published a list of descriptions for all 256 of these functions, attempting to use the minimum number of symbols (p,q,r,not,and,or) in each case. Georgiadis pointed out that he could have done better in 44 cases. For instance, Wolfram labeled the function given above as Rule 2, and gave the intuitive 7-symbol representation

      f(p,q,r) = (not p) and (not q) and r

      while Georgiadis gave a 6-symbol representation

      f(p,q,r) = r and not (p or q)

    3. Re:I think I speak for a lot of people here ... by fyngyrz · · Score: 4, Informative

      First of all, mod parent up. I know you moderators suck ass and the system is broken, but come on - parent post is a precise description of TFA's issue, the first in the thread. If you're going to spend mod points at all and pretend they do something worthwhile, parent post is the place.

      Secondly, Wolfram's point - in the book - wasn't that the descriptions were minimal (even if he may have mentioned that he thought they were, which I don't actually recall), his point was that they were a complete set of correct descriptions (which I would add are functionally equivalent to the minimal ones anyway) that one can examine for certain behaviors he thought were significant. Niggling about the description not being minimal does not affect what Wolfram was trying to say to the reader. He may be completely wrong, but this kind of nit-picking can not and will not demonstrate it. It is a complete waste of everyone's time.

      --
      I've fallen off your lawn, and I can't get up.
    4. Re:I think I speak for a lot of people here ... by morcheeba · · Score: 1

      De Morgan wins again! (and the p's and q's are in exactly the same order as on the wikipedia page)

    5. Re:I think I speak for a lot of people here ... by Bananenrepublik · · Score: 1

      For instance, Wolfram labeled the function given above as Rule 2, and gave the intuitive 7-symbol representation




      f(p,q,r) = (not p) and (not q) and r




      while Georgiadis gave a 6-symbol representation




      f(p,q,r) = r and not (p or q)

      So Wolfram doesn't know Morgan's rule?
    6. Re:I think I speak for a lot of people here ... by pongo000 · · Score: 1

      So, IOW, careful application of DeMorgan's Theorem results in the simplification of some of Wolfram's functions.

      And the impact of this is...what, exactly? Aren't the original functions and new functions still equivalent?

    7. Re:I think I speak for a lot of people here ... by fyngyrz · · Score: 4, Interesting

      Aren't the original functions and new functions still equivalent?

      They are. Wolfram was saying, Look here, for each case, applying the following CA rules gets you the following output set (smaller than the input set) of behaviors. So he was observing - in another way - that the various inputs resulted in a more sparse set of results (speaking as far as they are unique with respect to each other.) Once he identified the various types of behavior possible from these sets, he showed that some were very orderly, some considerably less so, some obviously recognizable - visually - as being members of the same classes of behaviors, and some not so obvious at all except that they certainly weren't in the easy-to-recognize class.

      From there - and it gets a lot more murky - he went on to propose that these very behaviors might underlay either everything, or darned near everything. To bolster that assertion, he showed that you could find those very patterns in many interesting and disjoint places - formulas seeming completely unrelated to anything he'd talked about thus far, seashell structure and so forth. That part of the book was downright breathtaking.

      It's really a very interesting book. His conclusions far outstrip his ability to back them up, but as far as TFA goes, it's looking at the very start of his chain of reasoning and applying some nitpicking that changes nothing he said or meant to say that had anything at all to do with the proposals and justifications made in the book.

      Personally, I could give the south end of a northbound rat if he has a high opinion of himself, or not. What I appreciate is that he provided me with a great read, thought provoking on the one hand, and as far as I could tell, without running into anything I knew that would make me question his approach or conclusions. I've got a good general science background, strong engineering and technical design skills, passable math, and am very creative; I do fairly well at finding little - occasionally large, usually not - holes in new science books and have a huge collection of such volumes full of snippy little annotations of my own (and just for my own benefit, on re-reading.) Aside from a really wonderful book on fuzzy logic which to this day I know of no faults with, this book stood out as almost uniquely solid in the specific area he was clearly trying to explain his thoughts on. I consider it money and time well spent.

      --
      I've fallen off your lawn, and I can't get up.
    8. Re:I think I speak for a lot of people here ... by The+One+and+Only · · Score: 1

      Two issues:

      • We have logical minimization algorithms already. EE's use them. Why hasn't anyone run them across Wolfram's functions? Why didn't Wolfram think to do so?
      • "Minimum number of symbols" is an interesting criteria. If you want to minimize each expression, you would have a wider set of logical operators: (p XOR q) is equivalent to (p OR q) AND (p NAND q), as well as (p OR q) AND NOT (p AND q). Using XOR instead of simply AND, OR, and NAND, or AND, OR, and NOT simplifies the expression to some extent. On the other hand, if you want to limit the set of logical operators, it would make more sense to limit your operators to NAND or NOR, since either one of those can construct all the others. (NOT p = p NAND p, p AND q = (p NAND q) NAND (p NAND q), etc.). Picking something in between (i.e. AND, NOT, and OR) seems arbitrary.
      --
      In Repressive Burma, it's not just your connection that dies. slashdot.org/comments.pl?sid=314547&cid=20819199
    9. Re:I think I speak for a lot of people here ... by Anonymous Coward · · Score: 0

      We have logical minimization algorithms already. EE's use them. Why hasn't anyone run them across Wolfram's functions? Why didn't Wolfram think to do so? Well, he isn't really very interested in anything but glamorizing himself. Correctness isn't really a factor in what he "publishes."

      "Minimum number of symbols" is an interesting criteria. If you want to minimize each expression, you would have a wider set of logical operators: (p XOR q) is equivalent to (p OR q) AND (p NAND q), as well as (p OR q) AND NOT (p AND q). Using XOR instead of simply AND, OR, and NAND, or AND, OR, and NOT simplifies the expression to some extent. On the other hand, if you want to limit the set of logical operators, it would make more sense to limit your operators to NAND or NOR, since either one of those can construct all the others. (NOT p = p NAND p, p AND q = (p NAND q) NAND (p NAND q), etc.). Picking something in between (i.e. AND, NOT, and OR) seems arbitrary. Minimum number of symbols is taken to mean "minimum number of symbols using some fixed set of operators." The problems of minimizing number of symbols by adding new operators and minimizing number of different operators used are both quite uninteresting, as you yourself make apparent.
    10. Re:I think I speak for a lot of people here ... by littlewink · · Score: 1

      Aside from a really wonderful book on fuzzy logic which to this day I know of no faults with...


      May I ask what book on fuzzy logic that was?

      P.S.
      Thanks for the polite "south end of a northbound rat" euphemism!
    11. Re:I think I speak for a lot of people here ... by The+One+and+Only · · Score: 1

      Minimum number of symbols is taken to mean "minimum number of symbols using some fixed set of operators."

      Why any particular fixed set?

      --
      In Repressive Burma, it's not just your connection that dies. slashdot.org/comments.pl?sid=314547&cid=20819199
    12. Re:I think I speak for a lot of people here ... by fyngyrz · · Score: 1

      The book is "Fuzzy Logic" by McNeill and Freiberger, 0-671-73843-7. I *really* enjoyed that book. I like

      Southbound... that's one of my two originals. The other isn't quite as polite - when something is dead, expired, blown up, crashed, faulted or otherwise demised in a terminal fashion, I use "darn thing is nipples north" or some similar construction. Some kind of magnetic affinity happening there, clearly. :-) Feel free, it it takes your fancy.

      --
      I've fallen off your lawn, and I can't get up.
    13. Re:I think I speak for a lot of people here ... by jklappenbach · · Score: 1

      Perhaps that's a good reminder for those in the field (as well as any related) to brush up on Boolean Algebra. Though I hesitate to fault Wolfram for overlooking an important step in reducing his assertions to their most minimal, efficient statements, I can't help but consider how important BA has been in shaping digital technology.

      http://en.wikipedia.org/wiki/Boolean_algebra_(logic)

      -jjk

    14. Re:I think I speak for a lot of people here ... by SharpNose · · Score: 1

      I felt as you did about the book, more or less. I felt like the book wasn't rigorous but it presented a lot of concepts that were very provocative. When he started talking about CA and biology, I was disappointed that he seemed to run out of road. I mean - here are CA, here's a zebra - what the hell gets me from point A to point B there?

      But the book changed my way of thinking. I stare at this weird kind of cauliflower at Whole Foods because it's got at least three levels of self-similarity that I can see with my naked eye. I'm fascinated by the self-organization exhibited by a handful of cleaning rags in my dryer. And I wonder, as SW did, what if people like him - i.e., combinatoricists, automatomaters (i made up those words) - had gotten hold of digital computers first, and not engineers who were all about floating-point math?

    15. Re:I think I speak for a lot of people here ... by ratboy666 · · Score: 1

      Thank you.

      And, I want to point out the practical application -- computer graphics. Our friends at Microsoft had decided that "ROP Functions" should be implemented by display drivers. Indeed, the "ROP Functions" were this set of 256 functions. Windows 3 days; I am not familiar if this is currently the case.

      The solution? Since the target was always an Intel processor, generate machine code sequences of increasing time complexity, and, as each is generated, see if it solves one of the Functions. Since the seach is over the complete legal instruction sequence space, and is ordered by speed, it guaranteed the lowest cost operation for each of these functions.

      The code was prepared, and run, in 1991. Run time? Minutes. It wrote the ROP compiler (at this point, Windows 3 used a "Blit Compiler", so this would be a meta-compiler). (PS. It gave some counters to Worlfram's Conjectures). Of course, it didn't actually PROVE anything (at least in symbol length terms) because it was driven by least execution cost, without being limited to that set of operations (any x86 opcode was available, ordered by opcode cost on a 80486).

      The devs name was Pat (something?) -- Paul Hsieh was also in my group at the time, and may remember Pat's last name (to give proper credit). I just reviewed the results of the program (being a "manager type" at the time, and trying to convince Microsoft that a "DirectX" architecture would be useful, and that framebuffer drivers could be used for underlying support -- we demoed these technologies to Microsoft in '90, but didn't have "permanent" Microsoft resident staff at Redmond till a year later - which ended up being terrifically funny, because our proprietary code was checked in at MS, and was then ripped off by the competition, bugs and all).

      I just wanted to record some of the history, and see if anyone else remembers Pat to give him the well-deserved credit for writing the "Function Finder" that ended up on millions of PCs.

      --
      Just another "Cubible(sic) Joe" 2 17 3061
    16. Re:I think I speak for a lot of people here ... by ratboy666 · · Score: 1

      Actually, all "got a hold of" computers at the same time.

      The history of programming languages is quite instructive. It relates to algorithms, and possible uses.

      First, we have machine code - tedious, and then assemblers (autocoders). Designed to take SOME of the burden of counting. (labels, branch targets).

      Then, the idea of compiling formulas (math) -> FORTRAN. The experience of FORTRAN leads to BNF format (Backus *is* Mr. Fortran), which brings us to: COMIT and SNOBOL

      In SNOBOL4, a BNF description is (more than less) DIRECTLY executable. Its all about patterns, right? FWIW - SNOBOL4 (1966) has associative tables, patterns more powerful than REs, self-modifying code, dynamic memory, recursion.

      Also, interest in how computers (should) work, and the "correct" way to do a program led to LISP. At the same time as FORTRAN.

      Interest in accounting led to COBOL in 1960.

      And, iterest in mathematical programming (arrays, etc.) led to APL (at the same time). APL and LISP have dynamic memory management as well.

      So, we have:

      FORTRAN (static, no need for gc)-> ALGOL -> PASCAL (dynamic, no gc - new/free) -> C -> JAVA (dynamic, gc), etc.
      SNOBOL (dynamic, gc) -> ?? (bizarre, the only "dead end" here)
      LISP (dynamic, gc) -> SCHEME, functional languages
      COBOL (static, no need for gc) -> well, COBOL
      APL (dynamic, gc) -> J, Matlab

      The reason I believe SNOBOL was "dead-ended" is that it was simply TOO powerful to be taught (I recall a prof saying "to solve this, use ANY language, EXCEPT SNOBOL).

      In a sense, LISP is similar, given a rich library (Common LISP)...

      Why did only one of these strands become "main-stream"? An excellent question. One reason is that ACM wanted algorithms in ALGOL/FORTRAN. Another is that computers were VERY expensive, and avoidance of garbage collection was almost -- religious -- for a while. A third was the introduction of "FORTRAN in short pants" aka BASIC.

      Also the FORTRAN strand seems to model the perceptions of GC efficiency as time goes on (initially, on static allocations, then new/free, then dynamic with gc).

      Opinions welcome, flames to /dev/null, as usual.

      --
      Just another "Cubible(sic) Joe" 2 17 3061
    17. Re:I think I speak for a lot of people here ... by ratboy666 · · Score: 1

      Sorry for replying to myself -- the fellows name is Pat Maupin. Credits to him!

      --
      Just another "Cubible(sic) Joe" 2 17 3061
    18. Re:I think I speak for a lot of people here ... by Anonymous Coward · · Score: 0

      See, for example, this and the hardcopy literature references therein:

      A000616 a(-1)=1 by convention; for n >= 0, a(n) = number of irreducible Boolean functions of n variables.
      n a(n)
      -1 1
      0 2
      1 3
      2 6
      3 22
      4 402
      5 1228158
      6 400507806843728
      7 527471432057653004017274030725792
      8 11218076601767519586965281984173341005925142853855481024470471657123840

      -- Prof. Jonathan Vos Post

    19. Re:I think I speak for a lot of people here ... by dealmaster00 · · Score: 0

      Wow, so Georgiadis caught Wolfram on a DeMorgan's Theorem technicality ( (not p) and (not q) is equivalent to not (p or q) ). The truth sounds so much less severe than the title of the article (44 Conjectures of Steven Wolfram Disproved). You don't need to be an "MIT errata expert" to figure this out, just a first year course in logic/set theory (or browsing Wikipedia). In other words, this so-called discovery by Georgiadis is a lot less impressive than everyone is making it out to be.

    20. Re:I think I speak for a lot of people here ... by Pepsiman · · Score: 1

      "Function Finder" More commonly known as a superoptimizer.
    21. Re:I think I speak for a lot of people here ... by ratboy666 · · Score: 1

      Pepsiman - thanks for the reference. I haven't (as yet) read the literature, but it was an interesting issue at the time, and the idea of generalizing to a peephole optimizer is very interesting.

      --
      Just another "Cubible(sic) Joe" 2 17 3061
  10. Re:Humm... by Anonymous Coward · · Score: 0

    Whose name is he supposed to hype? Yours?

  11. Re:Humm... by ceoyoyo · · Score: 5, Funny

    For particularly small values of "everyone" of course.

  12. Re:Humm... by IgnoramusMaximus · · Score: 5, Insightful

    Whose name is he supposed to hype? Yours?

    Nobody's.

    And no hype either.

    That is because the supposed subject of all this is Science. And hype and personality cults are to science as money is to politics: corrupting, destructive, counter-prodctive forces.

    Reason, peer review, rigourous analysis, unassailable demonstration of proof, etc are the ways of science, not ascension to prominence via grooming oneself for mass-media "stardom" by boggling the "minds" of the rather feebly-minded general public.

  13. MIT Errata Expert, eh? by mathcam · · Score: 4, Funny
    "...so basically I'm really good at being right about things that other people are wrong about."

    Wait a minute, that's what I do!

  14. That's egg on his face. by yotto · · Score: 3, Funny

    "The formulas provided by Wolfram for these [44] rules are not minimal. Moreover for 8 of these cannot be minimal even by simple inspection since minimal formula sizes for 3-input Boolean functions over this basis never exceeds 5."

    Oh, SNAP!

    1. Re:That's egg on his face. by mcg1969 · · Score: 5, Informative

      That's not as much of a SNAP! As you think. The reason that "simple inspection" reveals that the formulas are not minimal is because, in an earlier paper, the same author demonstrates that 5 boolean operators are sufficient. So it actually took a bit more than "simple inspection" to get there.

    2. Re:That's egg on his face. by Anonymous Coward · · Score: 0

      Lol, you really need to learn what the expression "Oh, snap" means :)

    3. Re:That's egg on his face. by JavaRob · · Score: 1

      Lol, you really need to learn what the expression "Oh, snap" means :) It is suddenly staggeringly clear it is *you* who are ignorant of the true meaning of the snap.

      Third party observer: "Aw, snap!"

      Indubitably, my brother; indubitably -- my diss is now affirmed.
  15. The paper is not as hostile as the citation by mcg1969 · · Score: 4, Insightful

    The author of the article, Evangelos Georgiadis, has participated in two of the "New Kind of Science" summer schools (2003, 2005; the link above is from 2003). I must suspect, then, that he is somewhat sympathetic to Wolfram's work, and his papers are not intended to be hostile attacks. Indeed, his paper really doesn't read that way, from my perspective as an academic; it is simply a correction of errors. Indeed, if anything, this work tends to buttress Stephen Wolfram's basic point (whether it is true or not) because it further reduces the complexity of CA implementations.

    1. Re:The paper is not as hostile as the citation by mcg1969 · · Score: 5, Informative

      If you go to the NKS Forum, you can find quite a few contributions by the author of this paper, and many of them are error corrections or other disputes with the content. To try it yourself, go to the search page and type in "Evangelos Georgiadis" into the "Search by Author" field, select "Show results as posts", and click "Perform Search."

      I think if you read through the posts yourself you'll see his overall interest seems to be in improving the text, not tearing it down. In fact, one of the threads he created is called "Further Improvements and Errata."

    2. Re:The paper is not as hostile as the citation by iwein · · Score: 1

      It doesn't even seem to me that the author of the notes is correcting errors; he is merely showing that the functions are not minimal. This does nothing to discredit the original work as long as it doesn't claim they are in fact minimal (i haven't read the original work).

      We could discuss if it is bad if you take more than the minimal amount of data needed to communicate a point, but that would be a bit hypocritical I guess.

      --
      Show a man some news, distract him for an hour. Show a man some mod points, distract him for the rest of his life.
  16. Re:Obligatory by uberchicken · · Score: 0, Flamebait

    No, it was not necessary. You and all the other clowns who say "somebody had to", please fuck off.

  17. Re:Humm... by PachmanP · · Score: 1

    I admit my youth, but I have never heard of Science such as you describe it. Surely, you are mistaken?

    --
    You're thinking small. Why miniaturize the laser, when we could instead enlarge the sharks? -John Searle
  18. The only reason I like Wolfram to any degree.... by Anonymous Coward · · Score: 0

    Is that I can't believe that Feynman was wrong. No. Must not be. Cannot be.

    But apart from that, he seems to be an _____.

  19. Not Really by aweinert · · Score: 1

    All the author does is show that 44 of the boolean equations [out the 256 3 input equations in 1-D cellular autmata] Wolfram provides are not minimal.
    The author also shows that 8 of these are not minimal by inspection, since the maximum size of the minimal equations over this basis is 5.

  20. What's good for the goose by mcg1969 · · Score: 2, Insightful

    Likewise, the fact that Stephen Wolfram is an arrogant blowhard should not prevent people from making a reasoned assessment of his work. And that is, in my view, what seems to be happening. Sure, Wolfram is hogging some undue spotlight right now. But his work is absolutely useless unless it can be reproduced, verified, built upon, and applied by others. Give it 20-50 years and we'll see what happens. My prediction is that Wolfram's claims about the work, in particular its wide applicability, will be proven to be wildly overstated. But my prediction is as valuable as the bandwidth it is transmitted upon.

    1. Re:What's good for the goose by Omnifarious · · Score: 1

      I agree wholeheartedly. The real test is not Wolfram's perceived reputation among either mathematicians or everybody else. The real test is how well his work holds up to scrutiny.

      But criticizing any individual person putting his work under that scrutiny for holding a grudge is silly. It's precisely those kinds of emotional attachments which drive people to do the hard work of grinding through the theories and either proving or disproving them. It neither makes their work more or less valid.

    2. Re:What's good for the goose by Weezul · · Score: 1

      Academics don't mind arrogant blowhards, but they object to plagiarism.

      --
      The Christian religion has been and still is the principal enemy of moral progress in the world. -- Bertrand Russell
  21. WARNING DO NOT CLICK LINK by Anonymous Coward · · Score: 0, Insightful

    I don't know what it is, I just know not to click it.

  22. Re:Humm... by IgnoramusMaximus · · Score: 3, Insightful

    The fact that various people continuously try to remodel Science into a contest of egos and popularities does not change the fundamental fact that Science itself is in the long term immune to such tactics.

    And those who attempt it end up, sooner or later, with the only scientific title they deserve: "Crackpot", their "theories" having been ground into dust by the slowly, unglamorously, mundanely, steadily turning wheels of the scientific method.

  23. Re:Humm... by Anonymous Coward · · Score: 0

    Bitter that you don't amount to a hill of beans?

  24. Re:Humm... by Anonymous Coward · · Score: 0

    nobody attacks you puppie dummy ... it's simply Wolfram is wrong and i'm sorry if u cannot deal with it.

  25. Re:Humm... by thethibs · · Score: 1

    Obviously someone who hasn't read the book...

    It's not arrogant to present some of your best work as conjectures—a mathematician's term for "A wild-assed guess, but wouldn't it be interesting if it were true?"

    Given that one of the implications of Wolfram's work is that you can do a lot of neat stuff with algorithms that are out of scope for conventional mathematics, many on Slashdot should enjoy reading ANKS. Among other things, committing some of his constructions to code is fun.

    --
    I'm a Programmer. That's one level above Software Engineer and one level below Engineer.
  26. Do not click? It's the subject of the article! by Ed+Pegg · · Score: 1

    The paper at the heart of this slashdot discussion deals directly with http://www.wolframscience.com/nksonline/page-884 There are 256 boolean expressions on this page from Stephen Wolfram's book The paper claims to give 44 shorter expressions.

  27. Obviously! by Anonymous Coward · · Score: 0

    "8 of these cannot be minimal even by simple inspection since minimal formula sizes for 3-input Boolean functions over this basis never exceeds 5." See, that's just common sense, obviously...Christ, I tried, I tried REAL REAL REAL hard several times to get through NKS without having my eyes gloss over because it was so technically tricky. At least the illustrations were beautiful, I suppose.

  28. Simple title correction. by ksw2 · · Score: 4, Insightful

    s/Disproved/Improved/

  29. use of a conflicting basis? by epine · · Score: 0

    Perhaps Wolfram was counting the weight of "not" as zero in his mind when he constructed his table. I'm not going through the reg page to find out what he actually wrote. His error could be as small as *printing* that he was giving weight one to "not" when in fact he hadn't.

    Personally, I find it rather arbitrary to give a weight to the unary not operator. It strikes me as more fundamental (and less arbitrary) to take as your basis the set of *all* binary input truth functions.

    Suppose you change your basis from and,or,xor,not to nand,or,xor,not and this gives you a different length bound? What is the significance of the length bound then? Stupid.

    Here is the thing to check, if anyone is interested. Is Wolfram's table correct if you weight "not" to zero?

    1. Re:use of a conflicting basis? by Anonymous Coward · · Score: 0

      Personally, I find it rather arbitrary to give a weight to the unary not operator. It strikes me as more fundamental (and less arbitrary) to take as your basis the set of *all* binary input truth functions.

      They aren't linearly independent. The Scheffer stroke is a generator for this structure.

    2. Re:use of a conflicting basis? by epine · · Score: 1

      They aren't linearly independent. The Scheffer stroke is a generator for this structure. I hadn't heard of the Scheffer stroke by that name, but I have known nand is sufficient for a long time. For as long as I looked at this, it appeared that the game was to establish a descriptive upper bound representing three-input truth functions in terms of a chosen basis of binary-input truth functions. What is the usefulness of the descriptive bound is the value changes rather arbitrarily depending on precisely which basis one selects? What does linear independence have to do with it?

      This reminds me of a paper by Putnam (IIRC) I read a long time ago. He puts forward two different set-theoretic constructions of the integers, with the major distinction that in one construction, x y implies x is a subset of y; this does not hold in the other construction. Both constructions describe the same properties of the integers, but they also introduce arbitrary mathematical artifacts particular to the set-theoretic underpinnings adopted.

      What is Wolfram attempting to do where it would matter that that the chosen basis was linearly independent?
    3. Re:use of a conflicting basis? by Anonymous Coward · · Score: 0

      Hmm ... your comment amounts to stupidity or just laziness ... if you think about it, even if you include or exclude the NOT operator Georgiadis' Formulas are minimal. besides he goes with the way Wolfram's defined it. and then even if you twist the definition Wolfram's results still remain inconsistent so this is quite an achievement of Evangelos Georgiadis to have shown inconsistency.

  30. Re:Humm... by Chapter80 · · Score: 1
    Hey, it takes some guts to go out on a limb. ESPECIALLY in a field where your work can be "proven wrong".

    I have a lot of respect for the guy for trying, and for getting SOME of it right. That's more than 99% of the slashdot readers! Where would we be if it weren't for the brave few who publish their works for peer review?

  31. Superb, now the tag by murderlegendre · · Score: 1

    Humbly, please tag as "disimprovement"

    --
    There's a Starman, waiting in the sky / He'd like to come and meet us, but he hasn't got the time.
  32. Full text of "A New Kind of Science" is online by slacka · · Score: 2, Informative

    You can read the full text of "A New Kind of Science" online for free at http://www.wolframscience.com/nksonline/toc.html

  33. citation of unpublished result by Anonymous Coward · · Score: 1, Insightful

    While I'm not surprised to see people refute some of Wolfram's claims, I hate seeing preprints distributed that have key citations that are "Unpublished results". The whole point of peer review is to treat results as believable when they can be independently verified. Citing unpublished work is a bit sketchy. It would be nice if people could wait before distributing results until proper review has taken place (but then again, this is refuting wolfram, the kind of non-peer-reviewed publication).

    1. Re:citation of unpublished result by Auckerman · · Score: 1

      That's not completely how it works. When your working on a project, you maintain current results for others to work from. Of course, you don't let them know everything you know, so that you don't lose a coming grant proposal to them, but enough so that you are actually furthering the science before publishing. In the case of unpublished results, those are shown all the time, in a peer review system. Conferences, your web page (getting an email that there's a better way is something you want to have happen), or conversations over coffe. The ultimate goal is publishing. Part of the process requires unpublished peer review to happen. In this case, I'll lay money he is past his final version, it's past or nearly pasted all reviews before publishing, and he's seeking comment on his work. Furthering the science. It's all part of the natural process.

      Now if he held a press conference with no intent on publishing, that's when it looks fishy.

      --

      Burn Hollywood Burn
  34. Re:Full text of "A New Kind of Science" is online by Keyframe2 · · Score: 0

    Ofcourse it is. After I bought the book, ofcourse.

  35. Re:DON'T BE SUCH A PUSSY by Anonymous Coward · · Score: 0, Flamebait

    The link is just another myminicity thing. He was right. And you're an idiot.

  36. Re: Gearge? by TaoPhoenix · · Score: 1

    I think I know why.

    You have to spell your adversary's name correctly first.

    --
    My first Journal Entry ever, in 8 years! http://slashdot.org/journal/365947/aphelion-scifi-fantasy-horror-poetry-webzine
  37. Why is this even on /. ?? by madbawa · · Score: 1

    I had all my conjectures and overtures disproved and disapproved. Big deal.

  38. Re:Humm... by Omnifarious · · Score: 1

    Well, we are talking mathematicians here.

    That leads me to an interesting musing, if there were an infinite number of people, would there then be an infinite number of people (even if it were still a small fraction of the total infinite number of people) capable of evaluating the theorems and proofs in Stephen Wolfram's book?

  39. He should be the proofreader for WolframTuringPriz by yuliardina · · Score: 1

    I wonder how many loopholes Evangelos Georgiadis will find in Wolfram's Turing Machine Prize Proof. Well, if there are any I'm sure he is the best candidate to spot them (excluding Don Knuth who is also an errata expert but too busy at the moment).

  40. Re:Obligatory by Anonymous Coward · · Score: 0

    On Soviet Slashdot, off fucks you!

  41. Re:Humm... by Anonymous Coward · · Score: 0

    Money is a corruptive force in politics only if allowed to go unchecked. Ditto personality and hype for science.

    This reminds me of a tragically vehement argument I had with a good friend about the value of Carl Sagan's work on Cosmos, as well as his overall attempts to publicize space science. I was of the opinion that Sagan was, and perhaps still is, the best thing to happen to space exploration since Von Braun. My friend believed Sagan's methods to be underhanded and self-promoting.

    Prominence is a way to get the message out. And where would we scientists and sundry other "smart people" be without that "wow" moment? I fall in love with science all over again when I learn something that floors me. That's not a bad thing.

  42. Re:Humm... by ceoyoyo · · Score: 1

    Yes. Infinity is funny that way.

    Wolfram had some interesting ideas, it's too bad he had to go and write a book and call it "A New Kind of Science." That's the title you let someone ELSE put on a book THEY write about your ideas, if your peers agree that they merit it.

    Your own book, you call something like "Relativity" (Einstein).

  43. that's not the problem with Wolfram by nguy · · Score: 0

    I wouldn't fault Wolfram for making this mistake; people do make mistakes. Wolfram's problem is with science, not bookkeeping: not properly crediting other people, trying to claim results and breakthroughs without having done the hard work to prove them, etc. Wolfram was not the first to formulate the ideas in "A New Kind of Science", and if they should turn out to become the foundation of physics over this century, the key ideas needed for making that happen will not have come from his book. That's the real problem with Wolfram.

  44. It's because of his family by wasted · · Score: 1

    ...Truly, like so many of our leaders, this Every One character is simply an influential dullard.

    It's sort of expected. Every One's brother No was looking out for him, so Every One got all of the good press. When things went well, Every One claimed responsibility. When things when poorly, No One accepted the blame.
  45. Evangelos Georgiadis, Math Instructor by Dareth · · Score: 1

    Wolfram labeled the function given above as Rule 2, and gave the intuitive 7-symbol representation
    f(p,q,r) = (not p) and (not q) and r

    Georgiadis gave a 6-symbol representation
    f(p,q,r) = r and not (p or q)


    In summary, Wolfram failed to simplify the equation properly, so in Georgiadis's mind, Wolfram failed it!

    I hate a nit picky math professor, but is there any other kind?

    --

    I only look human.
    My mother is a halfling and my dad is an ogre, so that makes me an Ogreling
  46. Re:Humm... by IgnoramusMaximus · · Score: 1

    You are confusing fame which comes about as a result of a peer-reviewed, rigorously tested but nevertheless astonishing discovery and attempts to force acceptance of your "theories" via appeals to the mass-media audience. Then there is also simple "popularization" of science, i.e. recasting complicated discoveries in terms more palatable to the public, which is what Sagan was all about.

    Fame and efforts at popularization are not a problem. Attempts to use a personality cult to bypass the peer review process are.

    As to politics, money is pretty much a universal corruptor. That is why most sane democracies have publicly funded campaigns and strict laws about acceptance of any contributions. It is not foolproof but it reduces the dirty politicos to rather dangerous to them (by the virtue of possibility of detection) methods, such as the one involving cash and brown envelopes.

  47. Re:Humm... by Omnifarious · · Score: 1

    Yes. Infinity is funny that way.

    Well, my thought was maybe there was some sort of cap on the number of people who could understand mathematical concepts that was below infinity. :-)

    And regarding the book's title, I agree completely. I was trying to tell a brilliant young (pre-HS age) friend when I was in college that certain titles are conferred upon you by others and you can't assume them yourself without seeming arrogant. And that was for something relatively minor like 'Unix Wizard'. :-)

  48. what else is wrong with this book by Anonymous Coward · · Score: 0

    i wonder what else is wrong in Wolfram's "highly acclaimed" book NKS apart from being highly "original" it appears to be "highly" flawed.

  49. different boolean formula -- inconsistency!!! by theunderground-Check · · Score: 0

    if you look closely enuff at the results you realize that Georgiadis's paper is rather deep, pinpointing what other major figures such as steven Weinberg criticized Wolfram for namely the lack of inconsistency witnessed when it comes down to definitions. There just isn't one coherent definition in the book or if there is one mentioned it is not followed consistently.

  50. NKS = Monster Raving Egomania and Utter Batshit In by why-the-nick-name · · Score: 1
  51. A new kind of science taken apart.. by Anonymous Coward · · Score: 0

    ..by cellular automata expert Shalizi,

    http://www.cscs.umich.edu/~crshalizi/reviews/wolfram/

  52. Georgiadis's Paper refutes NKS by Anonymous Coward · · Score: 0

    As pointed out previously "if you look closely enuff at the results you realize that Georgiadis's paper is rather deep, pinpointing what other major figures such as steven Weinberg criticized Wolfram for namely the lack of inconsistency witnessed when it comes down to definitions. There just isn't one coherent definition in the book or if there is one mentioned it is not followed consistently."

    what does one call a theory that does not stick to any given definition or in fact is not based on definitions at all ?