Works in ChatGPT, Claude, or Any AI
Add semantic quote search to your AI assistant via MCP. One command setup.
I thought... I had a pretty good idea for what the structure of this... theory that's underneath space and time and so on might be like. ...I thought… - Stephen Wolfram
" "I thought... I had a pretty good idea for what the structure of this... theory that's underneath space and time and so on might be like. ...I thought, "Gosh, in my lifetime... we might be able to figure out what happens in the first 10<sup>-100</sup> seconds of the universe. ...It's pretty far from anything that we can see today and it would be ...hard to test for what's right ...To my huge surprise, although it should have been obvious, ...we managed to get unbelievably much further than that. ...It turns out that even though there's this ...bed of computational irreducibility that ...all these simple rules run into, ...there are ...certain pieces of computational reducibility that ...generically occur for large classes of these rules, and... the big pieces of computational reducibility are ...the pillars of 20th century physics. That's the amazing thing, that general relativity and quantum field theory... turn out to be precisely the stuff you can say. There's a lot you can't say... at this... irreducible level where you.. don't... know what's going to happen. You have to run it [and] you can't run it within our universe... The things you can say turn out to be, very beautifully, exactly the structure that was found in 20th century physics...
English
Collect this quote
About Stephen Wolfram
Stephen Wolfram (born 29 August 1959) is a British scientist known for his work in theoretical particle physics, cellular automata, complexity theory, and computer algebra. He is the creator of the computer program Mathematica.
Related quotes. More quotes will automatically load as you scroll down, or you can use the load more buttons.
Additional quotes by Stephen Wolfram
Computational reducibility may well be the exception rather than the rule: Most physical questions may be answerable only through irreducible amounts of computation. Those that concern idealized limits of infinite time, volume, or numerical precision can require arbitrarily long computations, and so be formally undecidable.
Problem 9. What is the correspondence between cellular automata and continuous systems?
Cellular automatat are discrete in several respects. First, they consist of a discrete spatial lattice of sites. Second, they evolve in discrete steps. And finally, each site has only a finite discrete set of possible values.
The first two forms of discreteness are addressed in the numerical analysis of approximate solutions to, say, differential equations. ...
The third form of discreteness in cellular automata is not so familiar from numerical analysis. It is an extreme form of round-off, in which each "number" can have only a few possible values (rather than the usual 2<sup>16</sup> or 2<sup>32</sup>).
PREMIUM FEATURE
Advanced Search Filters
Filter search results by source, date, and more with our premium search tools.
Loading...