Talk:NAND Machine

How does memory work so that it's unbounded? It's very vague currently. –PkmnQ (talk) 12:16, 18 October 2026 (UTC)

The memory can be built from some loops made by NAND commands, which means that there can be infinite memory Assembly (^{my userpage}/_{send a message!}) 13:21, 18 October 2026 (UTC)

see VoidPtr to understand why your argument is flawed, but tl;dr: try simulating brainfuck program +[>+] --dragoneater67 [talk|contribs] 13:23, 18 October 2026 (UTC)

that will be pretty hard to do because, you know, there's no nand machine to bf converter yet Assembly (^{my userpage}/_{send a message!}) 13:24, 18 October 2026 (UTC)

then make one :-) --dragoneater67 [talk|contribs] 13:24, 18 October 2026 (UTC)

no >:) Assembly (^{my userpage}/_{send a message!}) 13:25, 18 October 2026 (UTC)

i guess theres no proof of turing completeness then --dragoneater67 [talk|contribs] 13:26, 18 October 2026 (UTC)

also I put "supposedly" in the thing Assembly (^{my userpage}/_{send a message!}) 13:26, 18 October 2026 (UTC)

We know what flip-flop latch is. Can you provide an example how to describe it in your language? The syntax description isn't detailed enough for a reader to do it. --Blashyrkh (talk) 13:26, 18 October 2026 (UTC)

e

if we can build chips with NANDs, we can build conditionals and stuff like that Assembly (^{my userpage}/_{send a message!}) 13:30, 18 October 2026 (UTC)

prove it with an example --dragoneater67 [talk|contribs] 13:31, 18 October 2026 (UTC)

ok bye

im not talking about this anymore Assembly (^{my userpage}/_{send a message!}) 13:33, 18 October 2026 (UTC)