BETA
This is a BETA experience. You may opt-out by clicking here

More From Forbes

Edit Story

Exploring The Computational Universe: From Mathematica To A Fundamental Theory Of Physics

Following

Soon after it was released a few short years ago, I began to delve into Steven Wolfram's new book, "A Fundamental Theory of Physics." I have followed his work since the early '90s when I first used Mathematica on an 80386 system. I remember being astounded by Mathematica's ability to handle symbolic calculations and its amazing graphics capabilities.

After Mathematica, Wolfram released "A New Kind of Science" in 2001, a comprehensive work on cellular automata, their properties, and implications. The book generated quite a buzz when it first came out. Wolfram was one of many to demonstrate how simple cellular automata could produce complex patterns. His magnum opus collected more examples and discussions on the phenomenon than I had previously seen in one place. The illustrations were captivating and would have been impossible to produce in the '70s or '80s due to computational limitations.

One particularly fascinating concept was the Turing-completeness of Game of Life-like automata, which Wolfram discussed in depth. This idea suggests that these automata can perform any computation that a modern computer can execute. The simple rules governing these computations could be easily specified and generated, allowing for a captivating exploration of a hypothetical universe filled with all such machines. If cellular automata could solve any computable problem and there existed a universe with all such automata, discovering computational solutions would no longer involve constructing a program but instead plucking it from this vast “computational universe.”

Another exciting aspect of cellular automata systems is that they also demonstrate emergence. Straightforward rules and shapes can result in repetitive, complex behaviors in terms of contributing to the build-up and upkeep of complex shapes and structures. For example, some simulations involving these systems demonstrate “gliders,”; forms that fly and travel across the board while maintaining their shape. There are also far more complex emergent phenomena possible, with constructs that resemble giant spaceships moving through the game board, supported by individual patterns that retain their structural integrity. Some patterns cause “factories” to be built, which in turn produce objects like gliders! The world of Life can genuinely be quite complex. And all this complexity speaks to the emergence of complex phenomena, even useful ones, from the simplest rules.

If simple rules lead to unpredictable outcomes and deep complexity in the game of Life, why not in real life? And the universe?

By the time "A New Kind of Science" was released, my fascination with genetic algorithms had already taken hold. I had a great time learning and experimenting by combining the concepts in Wolfram's book with genetic techniques to generate programs efficiently and evaluating their "fitness,” or their ability to solve a desired problem. However, another idea presented in the book introduced a limitation that explained why certain programs could never be evaluated swiftly: computational irreducibility. This concept posits that the only way to understand what some programs do is to run them and observe the results; there is no way to "fast forward" to a projection without performing all the intermediate steps. Computational irreducibility is not necessarily intuitive; it asserts that simply "reading" a program is insufficient to grasp its function – one must run the program to find out. Unlike Newtonian equations of motion that allow specific values to be plugged in to predict outcomes at a particular moment, many computer programs are irreducible to such a model.

On a less practical but still enjoyable note, the ideas of Ed Fredkin, which I had been pondering since my teenage years, and the subsequent release of "A New Kind of Science" inspired me to contemplate whether the universe was indeed a computer. Years ago, I wrote an essay on the topic, questioning if the infinite indivisibility of physical quantities we assume in the universe is not real and instead an artifact of the mathematical tools we use to examine everything around us. For example, Zeno's paradox assumes that space can be divided infinitely, but we have seen from modern physics that this assumption may not necessarily hold true.

I thought and wrote about whether the Universe was a computer for much of my teen years. In one conceptual model, I imagined that we were living in a digitized, quantized world due to the finite indivisibility of space-time. If space-time can be no smaller than an indivisible unit of Planck length, then what it can contain is also similarly bound. And if we have quantized space-time and a finite number of unique “symbols” to populate in this smallest “cell” of space-time, haven’t we just arrived at a computer data structure? Could entanglement, or “spooky action at a distance,” be a pointer between two memory locations? Could the evolution of the Universe as a system merely be algorithms acting upon the space-time data structure? And could it be that we somehow cause a selection of a dynamic slice of this vast data allowing us to perceive the current instance of time?

While these flights of fancy are fun and connected to deep questions, for a professional scientist and engineer, balancing these questions with pursuits that have real, measurable, and tangible goals is essential. I have found some balance in this regard through my career. I enjoy investigating such cosmically mysterious questions, but much of my time is spent in figuring out more immediately useful things. It is only now that the two are merging. Never before have we been able to contemplate and practical work on how emergence is actually helpful in the context of Generative AI products. Or how one can find inspiration from the idea of computational irreducibility to impose minimum resource costs on an operation, a “proof of work.”

The fascinating and the practical are more intertwined now than ever before! How lucky we are to be alive now.

But returning to where we started, people like Stephen Wolfram are important. They combine a practical side (Mathematica, Alpha) with the courage and desire to sometimes depart on flights of fancy (A new Physics) which may or may not lead to usable outcomes. Whether or not others consider it hard science, Wolfram's work has been a great source of intellectual stimulation and learning for me.

Computer Science is truly a vast ocean of knowledge and beauty. It is a noble pursuit if ever there was one. And it is connected to other deep science in a very unique way. Ideas that originate here often lead to insights in other disciplines, but it is also the science that allows tools to be developed which broadly advance all science.

I suppose when you love something as I have loved Computer Science, it is easy to find beauty in all its aspects and reflections. I hope you find similar loves in your life.

Follow me on Twitter or LinkedInCheck out my website