News for hackers. Stuff that matters.
Re:Full ZX-81 Chess in 1K (1983) by dragonwriter on Saturday January 31, 2015 @10:56PM (#8979113)
> Well, an instruction set is said to be Turing complete if it can be used to simulate any Turing machine. A single instruction can't

Incorrect. A single instruction can be Turing complete.

http://en.wikipedia.org/wiki/One_instruction_set_computer

Though the relevant question is whether universal computation can be built on the back of an instruction which plays chess rather than one of the more typical bases for a OISC.

Re:Full ZX-81 Chess in 1K (1983) by taejo on Sunday February 01, 2015 @03:43AM (#8979498)
> Though the relevant question is whether universal computation can be built on the back of an instruction which plays chess rather than one of the more typical bases for a OISC.

Well you can have two instructions: SUBLEQ and CHESS. Then it's Turing-complete, and there's a one-bit program that plays chess.

Re:Full ZX-81 Chess in 1K (1983) by sillysaurus3 on Saturday January 31, 2015 @11:47PM (#8979200)
This is awesome. Thank you.

What are some typical bases for OSIC?