Login  Register

Re: A question for tomorrow

Posted by Frank Wimberly-2 on Apr 28, 2019; 12:55am
URL: http://friam.383.s1.nabble.com/A-question-for-tomorrow-tp7593073p7593111.html

I'm not following.  What has LaTex vs Mathematica got to do with the proofs in question?

-----------------------------------
Frank Wimberly

My memoir:
https://www.amazon.com/author/frankwimberly

My scientific publications:
https://www.researchgate.net/profile/Frank_Wimberly2

Phone (505) 670-9918

On Sat, Apr 27, 2019, 6:52 PM Marcus Daniels <[hidden email]> wrote:
Russell writes:

< However, conversely, there appear to interesting results that indicate P=NP for random oracle machines. There is some controversy over this, though, and personally, I've never been able to follow the proofs in the area :). >

Minimally, why is LaTeX the preferred format and not, say, Mathematica?   At least the latter makes it complete and computable.

Marcus
============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
to unsubscribe http://redfish.com/mailman/listinfo/friam_redfish.com
archives back to 2003: http://friam.471366.n2.nabble.com/
FRIAM-COMIC http://friam-comic.blogspot.com/ by Dr. Strangelove

============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
to unsubscribe http://redfish.com/mailman/listinfo/friam_redfish.com
archives back to 2003: http://friam.471366.n2.nabble.com/
FRIAM-COMIC http://friam-comic.blogspot.com/ by Dr. Strangelove