⚡ Cursed Turing Completeness - Joel C
Рет қаралды 1,154
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.curtisbright.com/2013/03/... - Curtis Bright
drwho.virtadpt.net/files/mov.pdf - Stephen Dolan
github.com/xoreaxeaxeax/movfu... - xoreaxeaxeax
github.com/xoreaxeaxeax/movfu... - xoreaxeaxeax
calabi-yau.space/blog/doom.html - Jared Candelaria
www.sciencedirect.com/science... - G R Andrews
• On The Turing Complete... - Tom Wildenhain
@catlosgreg 7 ай бұрын
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 7 ай бұрын
why is ferris blue?
@warwickcomputing 7 ай бұрын
Cursed mix of programming logos: Its Ferris mixed with the Go Gopher.
@NotHumanPerson 7 ай бұрын
Ahh
UWCS - University of Warwick Computing Society
Рет қаралды 232 М.
UWCS - University of Warwick Computing Society
Рет қаралды 1,3 М.
UWCS - University of Warwick Computing Society
Рет қаралды 619
UWCS - University of Warwick Computing Society
Рет қаралды 5 М.
3Blue1Brown
Рет қаралды 2,7 МЛН
UWCS - University of Warwick Computing Society
Рет қаралды 1,1 М.
Мозголом
Рет қаралды 667 М.
notebook-31
Рет қаралды 144 М.
MaviGadget
Рет қаралды 10 МЛН