DeepMind’s Aletheia is a huge advance in AI-driven mathematical reasoning. It is a research agent built on top of Gemini Deep Think and uses an iterative process of generating candidate solutions, verifying them with a natural language-based checker to spot flaws, and revising as needed. It handles complex, open-ended problems more effectively than pure model …
Mathematician Thomas Bloom, runs erdosproblems.com, explains that OpenAI surfaced erdos problem solutions that were not unsolved. OpenAI GPT-5 simply surfaced existing papers solving them that he had personally overlooked, mislabeling them as “open” on his site. No new mathematics was generated—GPT-5 acted as an advanced search tool. OpenAI’s Mark Sellke and Sebastien Bubeck previously announced …
Google’s Gemini LLMs (Large Language Model) produced a new math discoveries and solves real-world problems. This is a significant step to AGI. The AI is speeding up progress in math and science. This is the first time a new discovery has been made for challenging open problems in science or mathematics using LLMs. FunSearch discovered …
Here is a three-hour talk on quantum computing and quantum theory reality and hype. Scott Aaronson is a professor of computer science at University of Texas at Austin and director of its Quantum Information Center. Previously he received his PhD at UC Berkeley and was a faculty member at MIT in Electrical Engineering and Computer …
A major new proof has combined Albert Einsteins Quantum Physics with Alan Turing’s Computing Theories. The new proof shows that quantum entangled machines can be used to verify solutions to problems that are as complicated and hard as the halting problem. Turing showed that Halting problem cannot be solved but we can use entangled systems …
Airbus chief technology officer (CTO) Grazia Vittadini predicts a quantum era in aerospace. Vittadini made this prediction in a Wall Street Journal article. Quantum computing research is being applied to tough flight physics problems. This is even with the small quantum computer systems that are available today. Nextbigfuture believes the pre-error corrected quantum computers that …
Is it possible for an efficient classical verifier (a BPP machine) to verify the output of an efficient quantum prover (a BQP machine)? The answer is Yes. Researchers show that a classical polynomial time verifier (a BPP machine) can interact with an efficient quantum prover (a BQP machine) in order to verify BQP computations. They …
Zoltan Toroczkai and collaborators have been working toward developing a novel analog mathematical approach that will help advance computation beyond the digital framework. They have a mathematical, analog “solver” that can potentially find the best solution to NP-hard problems. NP-hardness is a theory of computational complexity, with problems that are famous for their difficulty. And …
Many people have not taken advanced math or advanced science. They think education is all about teaching. However, it is a mistake to believe that a smarter or more accomplished professor will be able to teach all students. In math, people hit a learning wall. They are unable to master a foundational level of math …
IBM scientists have mathematically proven that there are certain problems that require only a fixed circuit depth when done on a quantum computer no matter how the number of inputs increase. On a classical computer, these same problems require the circuit depth to grow larger. The proof is that there will be problems that can …
