⚡ Cursed Turing Completeness - Joel C

How powerful (theoretically) is your computer? Well actually just as powerful as ......
Talk by Joel C.
Refrences:
• CHUNGUS 2 - A very pow... - sammyuri
/ cities-skylines-is-tur... - Daniel Bali
• Super Mario World -- C... - Seth Bling
bln.curtisbrig... - Curtis Bright
drwho.virtadpt... - Stephen Dolan
github.com/xor... - xoreaxeaxeax
github.com/xor... - xoreaxeaxeax
calabi-yau.spa... - Jared Candelaria
www.sciencedir... - G R Andrews
• On The Turing Complete... - Tom Wildenhain

[@catlosgreg]

Im not convinced by NAND being sufficient for turing completeness. an arbitrary combination of NANDs allows you only to compute a function over finite input, whereas a turing complete machine can compute functions over potentially unbounded input (which typically requires some memory to allow input across a number of time steps)

[@NotHumanPerson]

why is ferris blue?

[@warwickcomputing]

Cursed mix of programming logos: Its Ferris mixed with the Go Gopher.

[@NotHumanPerson]

Ahh