by DarnJackets November 01, 2018
He was Ture Zingmarking all over the place
by kallekarelin September 14, 2018
by Jawnsonvill May 25, 2024
"Turing-completeness" in computational theory, is a term used to refer to systems that can simulate a turing machine; in its physical representation, a tape deck that may move back and forth and have values in a cell manipulated, according to a preset program stack, in this case a punch card.
These systems may be mechanical, electronic, quantum or photonic and still considered turing complete, provided they are capable of running Doom, displaying Zouken Matou rule 34, posting/moderating threads on old.reddit.com and wire a payment to some middle age man posing as a female Twitch streamer. However, the vast majority of these systems are embedded electronic computers with support for a 32 bit kernel and a Java capable browser.
These systems may be mechanical, electronic, quantum or photonic and still considered turing complete, provided they are capable of running Doom, displaying Zouken Matou rule 34, posting/moderating threads on old.reddit.com and wire a payment to some middle age man posing as a female Twitch streamer. However, the vast majority of these systems are embedded electronic computers with support for a 32 bit kernel and a Java capable browser.
Yo check out my IBM Craptop I picked up for $20 from Vinnies
Wicked cool brother, can it run Crysis?
Fool, this baby's turing-complete
Wicked cool brother, can it run Crysis?
Fool, this baby's turing-complete
by FanOfStan April 22, 2023
Hey babe, send me a cunt•ture of you flicking your bean and in return, I'll send you a fat swollen dick•ture. So when I'm stabbing your pussy with it, you'll know what my cock looks like and you know what to prepare for..... Yes it'll all fit.
by Y•Not August 10, 2021