The Stephen Wolfram Podcast cover image

A conversation between Gregory Chaitin and Stephen Wolfram (July 5, 2021)

The Stephen Wolfram Podcast

CHAPTER

Is It a Good Measure for a Turring Machine?

So had you thought about the idea of a sort of size complexity for finite state machines before you thought about it for tuing machine programms? Oh, i mean, was that, that must have been one of the things that came out of that study. Exactly. So then so then the the real ar, you know, did you call it program size complexity? At the beginning, or did they call it? I think i called itProgram Size Complexity (PSC). That's what  I called it. And then you had a buncho technical issues about how big is a programme really is itself delimiting and all these kinds of things. But that was much later.

00:00
Transcript
Play full episode

Remember Everything You Learn from Podcasts

Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
App store bannerPlay store banner