GW. Wolfram's Principle of Computational Equivalence
03/30/10 • 7 min
Stephen Wolfram, creator of Mathematica and author of A New Kind of Science describes a fundamental principle, showing how irreducible complexity arises even in simple systems.
Stephen Wolfram, creator of Mathematica and author of A New Kind of Science describes a fundamental principle, showing how irreducible complexity arises even in simple systems.
Previous Episode
G4G9 Report From the Gathering
Quick interviews at the Gathering, with Stephen Wolfram, Will Shortz, Dale Seymore, John Conway and many others!
Next Episode
GY. Conversation with Greg Chaitin
A conversation with Greg Chaitin, creator of Chaitin's Omega and author, most recently, of MetaMath!! These ideas are well worth a close listen.
If you like this episode you’ll love
Episode Comments
Generate a badge
Get a badge for your website that links back to this episode
Select type & size
<a href="https://goodpods.com/podcasts/the-math-factor-11071/gw-wolframs-principle-of-computational-equivalence-387839"> <img src="https://storage.googleapis.com/goodpods-images-bucket/badges/generic-badge-1.svg" alt="listen to gw. wolfram's principle of computational equivalence on goodpods" style="width: 225px" /> </a>
Copy