BPP^(Wolfram Alpha)

Via @fortnow, Wolfram Alpha is now offering answers to classical complexity queries (see blog post at the WolframAlpha Blog).

This entry was posted in Computer Science. Bookmark the permalink.

2 Responses to BPP^(Wolfram Alpha)

  1. Kuas says:

    Piece of crap. It won’t even say whether or not P=NP.

  2. John Sidles says:

    I tested Wolfram Alpha on Emanuele Viola’s Theorem … “Are runtime bounds in P decidable?” … (correct answer: “no”) .
    Wolfram Alpha could not even parse the question, much less answer it, in a case for which TCS StackOverflow provided an answer within the hour.

Leave a Reply

Your email address will not be published. Required fields are marked *