wolframscience.com

A New Kind of Science: The NKS Forum : Powered by vBulletin version 2.3.0 A New Kind of Science: The NKS Forum > Pure NKS > Trivial for logic. Hard for quantum computing.
  Last Thread   Next Thread
Author
Thread Post New Thread    Post A Reply
Lawrence J. Thaden


Registered: Jan 2004
Posts: 355

Trivial for logic. Hard for quantum computing.

Here is a simple mechanism for reading out whatever is in a "black box".

Whenever you multiply modulo three sum the contents of the "black box" by logical 1 (rule number: 3812798742493), you get the contents of the "black box" as a result without changing the "black box" contents.

The example below verifies this for a random sampling of 32 rule numbers over the range of all possible three color, three variable rule numbers.

Union[FromDigits[
     Mod[IntegerDigits[3812798742493, 3, 27] IntegerDigits[#, 3, 27]
      3], 3] == # & /@ Table[RandomInteger[{0, 7625597484986}], {32}]]


{True}

__________________
L. J. Thaden

Report this post to a moderator | IP: Logged

Old Post 03-18-2012 09:00 PM
Lawrence J. Thaden is offline Click Here to See the Profile for Lawrence J. Thaden Click here to Send Lawrence J. Thaden a Private Message Click Here to Email Lawrence J. Thaden Edit/Delete Message Reply w/Quote
Post New Thread    Post A Reply
  Last Thread   Next Thread
Show Printable Version | Email this Page | Subscribe to this Thread


 

wolframscience.com  |  wolfram atlas  |  NKS online  |  web resources  |  contact us

Forum Sponsored by Wolfram Research

© 2004-14 Wolfram Research, Inc. | Powered by vBulletin 2.3.0 © 2000-2002 Jelsoft Enterprises, Ltd. | Disclaimer | Archives