July 26, 2026
One machine, many meltdowns
Multiway Turing Machines (2021 pre-ai)
Stephen Wolfram digs up an old idea, and the comments instantly smell a reboot
TLDR: Wolfram explores tiny computers that branch into many possible outcomes, arguing they could help explain both advanced computing and even physics. Commenters were torn between intrigue and eye-rolls, with some fascinated by the big ideas and others joking that he’d simply rediscovered an old concept with extra flair.
Stephen Wolfram’s latest blast from the pre-AI past is a big, brainy look at multiway Turing machines—basically a thought experiment where a simple computer doesn’t pick one next move, but splits into many possible futures at once. In plain English: instead of one path, you get a whole tree of paths. Wolfram says that makes these machines a neat way to think about everything from parallel computing to even quantum physics. He also teases a juicy idea: if ordinary tiny machines become powerful at one size, what’s the tipping point for these branching, many-path versions?
But let’s be honest: the real fireworks are in the reactions. One commenter immediately went cosmic with “Mathematical Connection between braids and computation,” which is exactly the kind of mysterious drive-by genius that makes tech threads feel like a late-night dorm room debate. Then came the sharper, meme-ready jab: “Like Turing before me, I have reinvented the nondeterministic computing machine...” Ouch. That line pretty much captures the mood from skeptics who think Wolfram is presenting an old computer science idea with a shiny new label and a dramatic trailer voice.
So the vibe is split between “this is a fascinating lens on how simple rules create wild complexity” and “sir, did you just rediscover something people already knew?” It’s classic Wolfram discourse: huge ambition, universe-sized framing, and a comment section ready to roast, riff, and philosophize in equal measure.
Key Points
- •The article defines multiway Turing machines as Turing machines in which a configuration can have multiple possible successors, producing a multiway graph of all possible evolutions.
- •It distinguishes this approach from standard nondeterministic Turing machine analysis by focusing on the complete structure of all paths rather than properties of individual paths.
- •The article links multiway systems to the author's Physics Project, stating that they lead to quantum mechanics and correspond directly to quantum Turing machines.
- •It states that all 4,096 ordinary Turing machines with 2 states and 2 colors ultimately behave simply, while 2 states and 3 colors yield the simplest ordinary Turing machine with complex behavior.
- •The article says the 2-state, 3-color ordinary Turing machine is universal and identifies 2 states and 3 colors as the universality threshold for ordinary Turing machines, then asks for the analogous threshold in multiway Turing machines.