x = 17, y = 10, rule = B3/S23
b2ob2obo5b2o$11b4obo$2bob3o2bo2b3o$bo3b2o4b2o$o2bo2bob2o3b4o$bob2obo5b
o2b2o$2b2o4bobo2b3o$bo3b5ob2obobo$2bo5bob2o$4bob2o2bobobo!
x = 15, y = 36, rule = B38/S23-
bo$2bo$3o14$13bo$12bo$12b3o2$11bo$12bo$10b3o4$12b3o$12bo$13bo2$10bo$8b
obo$9b2o$6b2o$5bobo$7bo!
72c20e wrote:the readers execute the programs on the tape
muzik wrote:Does the 24-cell function as a caltrop?
muzik wrote:...then how can it be self-dual?
Gamedziner wrote:Is there any way to stabilize superheavy elements through metastability? I'm thinking of something like tantalum-180m.
x = 4, y = 2, rule = B3/S23
ob2o$2obo!
x = 17, y = 10, rule = B3/S23
b2ob2obo5b2o$11b4obo$2bob3o2bo2b3o$bo3b2o4b2o$o2bo2bob2o3b4o$bob2obo5b
o2b2o$2b2o4bobo2b3o$bo3b5ob2obobo$2bo5bob2o$4bob2o2bobobo!
gameoflifemaniac wrote:Is it possible to emulate a normal computer in a quantum computer?
calcyman wrote:gameoflifemaniac wrote:Is it possible to emulate a normal computer in a quantum computer?
Yes, there's a standard trick for this. Given a function f : {0, 1}^n --> {0, 1}^m expressed as a circuit C of classical logic gates, you can replace the gates in the circuit with reversible equivalents to yield a reversible circuit C' (which may have lots of ancillary '0' inputs and some arbitrary messy outputs):
[n input bits][k ancillary '0' bits] --> [m output bits][n+k-m unwanted garbage bits]
Suppose we have another m ancillary '0' bits at this stage. Then we can CNOT the output bits with these ancillary bits to produce another copy of the output, like so:
[n input bits][k ancillary '0' bits][m extra '0' bits] --> [m output bits][n+k-m unwanted garbage bits][m output bits]
Now apply C' in reverse to the first n+k bits to clean up the mess we created:
[n input bits][k ancillary '0' bits][m extra '0' bits] --> [n input bits][k ancillary '0' bits][m output bits]
The upshot of this is that the ancillary '0' bits can be reused in a future computation. This combined circuit, ignoring the k ancillary '0' bits, actually computes the reversible function:
f : {0, 1}^(n+m) --> {0, 1}^(n+m)
(x, y) --> (x, f(x) XOR y)
Now, every reversible classical circuit is a quantum circuit (permutation matrices are unitary matrices), so this can be built out of quantum gates.
gameoflifemaniac wrote:calcyman wrote:gameoflifemaniac wrote:Is it possible to emulate a normal computer in a quantum computer?
Yes, there's a standard trick for this. [...]
Now, every reversible classical circuit is a quantum circuit (permutation matrices are unitary matrices), so this can be built out of quantum gates.
Adam, you are smart as hell.
not sure what you mean. But yes, there are tons of programs that find primes and you can easily multiply and add primes on a computer.gameoflifemaniac wrote:Are primes computable?
x = 17, y = 10, rule = B3/S23
b2ob2obo5b2o$11b4obo$2bob3o2bo2b3o$bo3b2o4b2o$o2bo2bob2o3b4o$bob2obo5b
o2b2o$2b2o4bobo2b3o$bo3b5ob2obobo$2bo5bob2o$4bob2o2bobobo!
Saka wrote:Is it possible to make a program that evolves itself? For example, it starts out as 1 file. The file is programmed to duplicate itself, but with some random "mutations" every duplication, like adding some specific code to a function wich gets called after a certain condition (Also mutable (e.g. function is called every 2 duplications)) and the worst files, determined by another program, the "fitness tester". Will this file be able to evolve so much with the right fitness tester and become an AI?
x = 17, y = 10, rule = B3/S23
b2ob2obo5b2o$11b4obo$2bob3o2bo2b3o$bo3b2o4b2o$o2bo2bob2o3b4o$bob2obo5b
o2b2o$2b2o4bobo2b3o$bo3b5ob2obobo$2bo5bob2o$4bob2o2bobobo!
Users browsing this forum: No registered users and 5 guests