Skip to main content
Turing completeness

Turing completeness

Search complete. 9 mentions across 8 episodes found for "Turing completeness".

Oct 12, 2026

RollerGatorHOST
84:03
Therefore must be conscious.
RollerGatorHOST
84:06
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.
RollerGatorHOST
84:43
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.
RollerGatorHOST
85:08
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 DoctorowGUEST
11:41
An iPhone can run every program.
Cory DoctorowGUEST
11:43
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.
Cory DoctorowGUEST
11:59
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.
Cory DoctorowGUEST
12:12
So why doesn't that code exist? Well, it's because that program has-- is illegal.
Jack MallersHOST
61:39
You know, all of these things made serious compromises to have the features they have.
Jack MallersHOST
61:46
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.
Jack MallersHOST
62:05
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.
Jack MallersHOST
62:18
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.
Tomer StrolightGUEST
55:03
if the scenario described, if I heard you correctly, manifests.
Tomer StrolightGUEST
55:07
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.
Bram KansteinHOST
55:43
Yeah.
Tomer StrolightGUEST
55:43
It's where the, it's where the heart of the value is.
Tomer StrolightGUEST
55:45
It's not about speed of transactions or privacy of transactions or running Turing-complete contracts.
Tomer StrolightGUEST
55:51
It's, here's a thing that is incorruptible by human beings who are corruptible.
Tomer StrolightGUEST
55:57
So stop...
Cory DoctorowGUEST
42:41
It was a felony to distribute because it would decrypt DVDs.
Cory DoctorowGUEST
42:43
He rewrote it as functional Turing-complete haikus.
Cory DoctorowGUEST
42:48
And-
Josh GoldbergHOST
42:48
That's incredible.
John RoseGUEST
12:34
And there's theory behind that.
John RoseGUEST
12:36
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.
John RoseGUEST
12:45
Undecidability, right? Undecidable, yeah.
John RoseGUEST
12:48
Undecidability, yeah.
speaker_1HOST
21:54
Your client decides how it looks.
speaker_0HOST
21:56
The entire attack surface shrinks down from a Turing-complete JavaScript engine to just your JSON parser and your boundary validation logic.
speaker_1HOST
22:05
Let's pull another question from our imaginary staff engineer.
speaker_0HOST
22:07
Listener Q&A time again.
John RoseGUEST
12:34
And there's theory behind that.
John RoseGUEST
12:36
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.
John RoseGUEST
12:45
Undecidability, right? Undecidable, yeah.
John RoseGUEST
12:48
Undecidability, yeah.

We value your privacy

We use cookies to understand how you use our platform and to improve your experience. Click “Accept All” to consent, or “Decline non-essential” to opt out of non-essential cookies. Read our Privacy Policy.