[FRIAM] A question for tomorrow

[Frank Wimberly]

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 <marcus at snoutfarm.com> 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
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://redfish.com/pipermail/friam_redfish.com/attachments/20190427/9df01e7f/attachment.html>