# Welcome To The Word Wide Mirror Sci.Math

#### Do you have a question? Post it now! No Registration Necessary.  Now with pictures!

•  Subject
• Author
• Posted on

As it turns out code is invertible; here is proof.

http://elgoog.rb-hosting.de/index.cgi?dir=/Top/Home/&page=Domestic_Services /

http://www.meami.org/?cx=000961116824240632825%3A5n3yth9xwbo&cof=FORID%3A9%3B+NB%3A1&ie=UTF-8&q =[+.www%2F%2F%3Aptth&sa=Search#964

## Re: Welcome To The Word Wide Mirror Sci.Math

Hello World Wide Web gro.imaem.www//:ptth{ wrote:

As it turns out, the proof is flawed; here is proof.

http://elgoog.rb-hosting.de/index.cgi?dir=/Top/Home/&page=Domestic_Services /

[1] 30199

http://elgoog.rb-hosting.de/index.cgi?dir=/Top/Home /

http://www.meami.org/?cx=000961116824240632825%3A5n3yth9xwbo&cof=FORID%3A9%3B+NB%3A1&ie=UTF-8&q =[+.www%2F%2F%3Aptth&sa=Search#964

http://www.meami.org/?cx=000961116824240632825%3A5n3yth9xwbo&cof=FORID%3A9%3B+NB%3A1&ie=UTF-8&q =[+.www%2F%2F%3Aptth&sa=Search#964

[1] 30234
[2] 30236
[3] 30237
[4] 30238

http://www.meami.org/?cx=000961116824240632825%3A5n3yth9xwbo
[2]   Done                    cof=FORID%3A9%3B+NB%3A1
[3]   Done                    ie=UTF-8
[4]   Done                    q=[+.www%2F%2F%3Aptth

--
Richard Heathfield <http://www.cpax.org.uk
Email: -http://www. +rjh@
"Usenet is a strange place" - dmr 29 July 1999

## Heathfield: You're wrong: here's proof: (WAS: Re: Welcome To The Word Wide Mirror Sci.Math)

<a name=3D"P_and_NP_trivia"></a><h2>P and NP trivia</h2>
<p>The <a href=3D"a/../Princeton_University">Princeton University</a>
computer science building has the question "P=3DNP?" encoded in <a
href=3D"a/../Binary_and_text_files">binary</a> in its brickwork on the
top floor of the west side. If it is proven that P=3DNP, the bricks can
easily be changed to encode "P=3DNP!". <a href=3D"javascript:jumpUrl
('fdp.koobdnah/sruot/patebuat~/ude.notecnirp.www//:ptth');">[1]</a>
</p>
<ul><li><a href=3D"a/../P_%28complexity%29">P (complexity)</a>
</li><li><a href=3D"a/../NP_%28complexity%29">NP (complexity)</a>
</li><li><a href=3D"a/../NP-complete">NP-complete</a>
</li></ul>
references</h2>
<ul><li> <a href=3D"javascript:jumpUrl('mth.xedni/smelborpezirp/
gro.htamyalc.www//:ptth');">The Clay Math Institute Millennium Prize
Problems</a>
</li><li> A. S. Fraenkel and D. Lichtenstein, Computing a perfect
strategy for n*n chess requires time exponential in n, Proc. 8th Int.
Coll. <i>Automata, Languages, and Programming</i>, Springer LNCS 115
(1981) 278-293 and <i>J. Comb. Th. A</i> 31 (1981) 199-214.
</li><li> E. Berlekamp and D. Wolfe, Mathematical Go: Chilling Gets
the Last Point, A. K. Peters, 1994. D. Wolfe, Go endgames are hard,
MSRI Combinatorial Game Theory Research Worksh., 2000.
</li><li> <a href=3D"a/../Neil_Immerman">Neil Immerman</a>. Languages
Which Capture Complexity Classes. <i>15th ACM STOC Symposium</i>, pp.
347-354. 1983.
</li><li> <a href=3D"javascript:jumpUrl('lmth.drah/tgc/nietsppe~/
ude.icu.sci.www//:ptth');">Computational Complexity of Games and
Puzzles</a>
</li><li> <a href=3D"javascript:jumpUrl('lmth.ytilamirp/swen/
ni.ca.ktii.esc.www//:ptth');">Manindra Agarwal, Nitin Saxena, Neeraj
Kayal, "PRIMES is in P", Preprint, August 6, 2002</a>
</li><li>  <a href=3D"javascript:jumpUrl('lmth.QAF_P_SEMIRP/cilgits~/
ac.lligcm.sc.otpyrc//:ptth');">The "PRIMES is in P" FAQ</a>
</li><li> <a href=3D"javascript:jumpUrl
('moc.oozytixelpmoc.www//:ptth');">Scott Aaronson's Complexity Zoo</a>
</li></ul>
<p>

</p>
Musatov
http://meami.org