Turing-complete

"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.

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

Turing tryst

The act of falling in love with a convincing AI.

A: Did you hear? Theodore got catfished hard by a chatbot last month.
B: Yeah, it was a real Turing tryst.