
Turing completeness
9
MENTIONS
8
EPISODES
8
PODCASTS
Search complete. 9 mentions across 8 episodes found for "Turing completeness".
Oct 12, 2026
This Dum Week 2026-10-11
R
84:03RollerGatorHOST
Therefore must be conscious.
R
84:06RollerGatorHOST
And it's like, no, no, you know, if, if, because here's, here's something that people are missing, particularly when they start talking about, well, maybe it is, um, The Turing machine, the Turing completeness of a computer is a description of its ability to perform computations such that any Turing complete mechanism is able to do the same computations and perform the same calculations given enough resources.
R
84:43RollerGatorHOST
And once you understand that GPUs, while they have an excessive amount of parallelization properties able to compute this astronomical amount of information very fast, you could duplicate the same process with what they call ticker tape and like a set of four instruction codes.
R
85:08RollerGatorHOST
You would need a lot of memory, and it would take forever and not be useful, but you could perform the same computations given enough time and resources on something that you would never
Cory Doctorow (2026) - Enshittification
C
11:41Cory DoctorowGUEST
An iPhone can run every program.
C
11:43Cory DoctorowGUEST
An iPhone's just a computer you put in your pocket, and we only know how to make one kind of computer, something called the Turing-complete universal von Neumann machine, which is what computer scientists call a calculating engine that can run every single valid program.
C
11:59Cory DoctorowGUEST
So that means that whenever Apple installs a ten-foot pile of shit in your iPhone, some programmer can make an eleven-foot ladder out of code that they can costlessly, instantaneously distribute to everyone who wants to use it.
C
12:12Cory DoctorowGUEST
So why doesn't that code exist? Well, it's because that program has-- is illegal.
Lesson 5: Bitcoin vs. Altcoins
J
61:39Jack MallersHOST
You know, all of these things made serious compromises to have the features they have.
J
61:46Jack MallersHOST
Vitalik wanted to bring Turing compete, complete smart contracts to Bitcoin, and the Bitcoin developer community deemed that it was far too vulnerable to attacks, because by allowing for Turing completeness, you allowed code execution on your machine, and the Bitcoin developer community said, "That sounds like it's really dangerous.
J
62:05Jack MallersHOST
We don't wanna force nodes to have to run someone else's code, and there's gonna be a lot of hacks." And what happened? Ethereum launched, and there's been a plethora of hacks.
J
62:18Jack MallersHOST
Solana, they wanted faster blocks for payments, and the Bitcoin community said, "Well, we have to account for the size of the world and the speed of light.
Why Is Bitcoin Still Alive If No One Is Running It? | Tomer Strolight | BFM290
T
55:03Tomer StrolightGUEST
if the scenario described, if I heard you correctly, manifests.
T
55:07Tomer StrolightGUEST
Why do people keep trying to do it? Well, one, they think they have a really good idea, and they think that that idea is worth the trade-off of sacrificing decentralization of, of, of being rulerless, right? And I, I think in those cases, I'd say they're missing the big picture, right? Like, "I have faster transactions," or, "I have private transactions," or, "I have the ability to compute Turing-complete contracts on chain." None of those things are as good as r- rules without rulers, because rules without rulers is where the freedom comes from in this thing.
B
55:43Bram KansteinHOST
Yeah.
T
55:43Tomer StrolightGUEST
It's where the, it's where the heart of the value is.
T
55:45Tomer StrolightGUEST
It's not about speed of transactions or privacy of transactions or running Turing-complete contracts.
T
55:51Tomer StrolightGUEST
It's, here's a thing that is incorruptible by human beings who are corruptible.
T
55:57Tomer StrolightGUEST
So stop...
Cory Doctorow on AI, Work, and Power
C
42:41Cory DoctorowGUEST
It was a felony to distribute because it would decrypt DVDs.
C
42:43Cory DoctorowGUEST
He rewrote it as functional Turing-complete haikus.
C
42:48Cory DoctorowGUEST
And-
J
42:48Josh GoldbergHOST
That's incredible.
"AOT Caching - Netflix' Practice vs OpenJDK's Theory" [I/O]
J
12:34John RoseGUEST
And there's theory behind that.
J
12:36John RoseGUEST
There's the theory of... of Turing completeness for the halting problem and Rice's theorem, which says it's not just the halting problem, folks, it's any question you might ask.
J
12:45John RoseGUEST
Undecidability, right? Undecidable, yeah.
J
12:48John RoseGUEST
Undecidability, yeah.
Agent Canvas - Part 1 - Who holds the brush?
S
21:54speaker_1HOST
Your client decides how it looks.
S
21:56speaker_0HOST
The entire attack surface shrinks down from a Turing-complete JavaScript engine to just your JSON parser and your boundary validation logic.
S
22:05speaker_1HOST
Let's pull another question from our imaginary staff engineer.
S
22:07speaker_0HOST
Listener Q&A time again.
"AOT Caching - Netflix' Practice vs OpenJDK's Theory" [I/O]
J
12:34John RoseGUEST
And there's theory behind that.
J
12:36John RoseGUEST
There's the theory of... of Turing completeness for the halting problem and Rice's theorem, which says it's not just the halting problem, folks, it's any question you might ask.
J
12:45John RoseGUEST
Undecidability, right? Undecidable, yeah.
J
12:48John RoseGUEST
Undecidability, yeah.