Y
Hacker News
new
|
ask
|
show
|
jobs
by
cluckindan
355 days ago
Nothing. Given infinite memory, a NAND gate is Turing complete by itself and trivial to construct based on the OP examples.
1 comments
csmantle
355 days ago
Unfortunately the examples provided by OP only contain combinational circuits, which by def. have no memory.
link
cluckindan
355 days ago
Well, there are half and full adders, maybe a flip-flop would be feasible?
link
csmantle
355 days ago
If we can introduce delay in the circuit it would be trivial to build FFs from Boolean-complete gate sets, thus sequential elements with memory. But AFAIK CSS if() can't introduce delays.
link
cluckindan
355 days ago
Keyframe animation?
link