saw this and wondered if you could make a go computer.
[url]https://www.youtube.com/watch?v=pdmODVYPDLA
[/url]

I don't think Go is Turing-complete as-is due to the size of the board causing computations to terminate early, but some generalizations of the game (for instance, on infinite boards) are said to be Turing-complete.

Don't ask me how, though! I've heard mutterings about using ladders as memory but I don't really grok it.

_________________
Joseki (n): 1. Japanese term meaning "when Jo lives in seki."

I don't know what "Magic The Gathering" is. But, years ago, I saw an article that said it was possible to build a computer using Conway's Game of Life. Circuits managed gliders. There were logic gates. There were reflectors that could change the direction of a glider. There was a "cross over" circuit.

A cash cow.

i'm a bigger fan of wireworld.
https://deltastep.blogspot.com/2017/03/ ... puter.html

Wireworld is much nicer for programming, but is unfortunately a little less interesting in terms of *construction*. You don't get to talk about self-replicating machines, universal constructors that use a Turing machine attached to a construction arm to build arbitrary new devices, or things like primality testers that endlessly self-construct up to arbitrarily large primes (rather than being wired to a fixed maximum number of digits).

A gateway to Burning Man?

_________________
The Adkins Principle:
At some point, doesn't thinking have to go on?
— Winona Adkins

Visualize whirled peas.

Everything with love. Stay safe.