Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2010

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: More Mathematica CAN'T do than CAN???

  • To: mathgroup at smc.vnet.net
  • Subject: [mg113375] Re: More Mathematica CAN'T do than CAN???
  • From: James Stein <mathgroup at stein.org>
  • Date: Tue, 26 Oct 2010 05:33:06 -0400 (EDT)

Turing Machines are implemented in Mathematica, so Mathematica can, in
principle, "do" any computable problem. Perhaps your learned friend is
merely suggesting, in a learned roundabout way, that fewer than half of all
mathematics problems are decidable?

On Sun, Oct 24, 2010 at 3:05 AM, Nicholas Kormanik <nkormanik at gmail.com>wrote:

>
> A few evenings ago I was speaking with a "learned mathematician" at
> the local university here.  In the course of our wide-ranging talk, he
> stated that Mathematica is only capable of doing less than half the
> problems in mathematics today.
>
> I was floored at his assertion.  I have only scratched the surface of
> all that Mathematica can do.
>
> There's tons more that it CAN'T do???
>
> Your comments are welcome.
>
> Nicholas Kormanik
>
>


  • Prev by Date: Re: nested SetDelayed
  • Next by Date: Re: Researchers break speed barrier in solving important class of
  • Previous by thread: Re: More Mathematica CAN'T do than CAN???
  • Next by thread: Re: More Mathematica CAN'T do than CAN???