BPP^(Wolfram Alpha)

Posted on 2/21/2011 by Pontifex Praeteritorum

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

Related posts:

  1. I am the anti-Wolfram
  2. A New Kind of Disclaimer
  3. Physicists and Computer Scientists
This entry was posted in Computer Science. Bookmark the permalink.

2 Responses to BPP^(Wolfram Alpha)

  1. Kuas says:
    2/21/2011 at 5:26 pm

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

    Like or Dislike: Thumb up 0 Thumb down 2

  2. John Sidles says:
    2/22/2011 at 12:31 pm

    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.

    Like or Dislike: Thumb up 0 Thumb down 0

Comments are closed.