Hilbert's Tenth Problem, Part V: The MRDP Theorem
Author: silverxz Proofreader: Acidmoon In this article, we will prove that the Diophantine sets are exactly the recursively enumerable sets. We have already noted that the direction from Diophantine sets to recursively enumerable sets is fairly straightforward. Let SSS be a Diophantine set with corresponding Diophantine equation D(x1,...,xn,y1,...,ym)=0D(x_1,...,x_n,y_1,...,y_m)=0D(x1,...,xn,y1,...,ym)=0. For (a1,...,an)∈Nn(a_1,...,a_n)\in \mathbb{N}^n(a1,...,an)∈Nn, we need only have a Turing machine MMM systematically try every possible y1,...,ymy_1,...,y_my1,...,ym to see whether D(a1,...,an,y1,...,ym)=0D(a_1,...,a_n,y_1,...,y_m)=0D(a1,...,an,y1,...,ym)=0 holds. If (a1,...,an)∈S(a_1,...,a_n)\in S(a1,...,an)∈S, the machine will eventually halt. The candidates must, of ...
Hilbert's Tenth Problem, Part IV: Basic Concepts and Proof Strategy
Author: silverxz Proofreader: Shiguang We now turn to the proof itself. This is not the original proof, but Matiyasevich’s greatly simplified version from his book Hilbert’s Tenth Problem, so its approach differs somewhat from the historical route described earlier. We will simplify parts of the argument further and skip details that are laborious but add no new ideas. The exposition often works backward: it starts from a result, asks what tools are needed to prove it, and then supplies those tools one by one. I will also use ordinary language to build an intuitive picture of the proof and explain its motivation, an approach better suited to a popular introduction. What is Hilbert’s Tenth Problem? Let us first restate the problem we want to solve. A Diophantine equation is a multi ...
Trial of Xuan: A Unity WebGL Game
Trial of Xuan · Unity WebGL The game opens on its own page rather than inside this article. The initial download is about 115 MB, so Wi-Fi is recommended. On a phone, it plays best in landscape mode. Play Trial of Xuan
Hilbert's Tenth Problem, Part III: The Road to a Solution
Author: silverxz Proofreader: Shiguang Many years later, when Hilbert’s Tenth Problem had finally been laid to rest, Martin Davis would surely remember that distant afternoon when his teacher said, “Hilbert’s Tenth Problem begs for an unsolvability proof.” We have already seen how Gödel, Turing, and others shattered the completeness, consistency, and decidability sought by Hilbert’s program. Hilbert’s Tenth Problem is simply a special case of the decision problem. The negative answer to that broader question transformed almost all optimism about Hilbert’s Tenth Problem into pessimism within a decade. Emil Post was one of the founders of computability theory, but fortune rarely favored him. At twelve, he lost his left arm in a car accident, which led him to abandon astronomy for mat ...
Fundamentals of Editing and Publishing
Author: Shiguang Reviewed by: Mei Shida Publishing and Editing Publishing, or more fully “publishing activity,” is the professional practice of selecting, editing, reproducing, and distributing works to the public. It encompasses the many steps that take a work from raw manuscript to finished publication, with the goal of bringing worthwhile information to readers. In Chinese, the word for editing can refer both to the process of organizing and refining source material or an existing work and to the professional who does that work, such as a book editor at a publishing house. Editors organize, record, collect, arrange, compile, and review intellectual works and other documents before presenting them to the public. Editing is an essential part of publishing and must happen before a publi ...
A Community-Curated Popular Science Reading List for World Book Day 2025
This April, with spring in full swing, we celebrated the 30th World Book Day. Books can be beacons when we venture into the unknown. A-kun’s call for popular science book recommendations brought in a trove of excellent titles, and this is the reading list our community put together. A Brief History of Time Stephen Hawking In accessible language, this book introduces cutting-edge ideas about the origin of the universe and humanity’s fate. From black holes and the Big Bang to time travel, Hawking’s vivid prose guides readers through the mysteries of a vast and astonishing cosmos. Both newcomers to science and readers with some background knowledge can find inspiration here. The book does more than explain scientific facts: it stirs curiosity, invites exploration, and asks us to consider hu ...
Hilbert's Tenth Problem, Part II: The Historical Background
Author: silverxz Proofreader: Shiguang The previous article introduced Hilbert and his 23 problems. The next two articles review the relevant history. This one covers the background needed for the tenth problem: the history of Diophantine equations, algorithms, and computability. The next article turns to the story of how Hilbert’s Tenth Problem was solved. Readers already familiar with this material may skip directly to that installment. Diophantine equations: from Diophantus to Hilbert The story has a classic opening: Once upon a time—or, more precisely, 1,800 years ago—the ancient Greek mathematician Diophantus studied a great many algebraic equations. At the time, that meant equations defined by polynomials with rational coefficients. His work covered many subjects, but one qu ...
Hilbert's Tenth Problem, Part I: Introduction
Author: silverxz People have a peculiar fascination with mathematical conjectures and the stories of how they were solved. Goldbach’s conjecture and Chen Jingrun, Fermat’s Last Theorem and Wiles, the theory of solvability by radicals and the work of Abel and Galois: such examples have found their way into elementary education. Children may not even understand what these problems say, yet they enjoy stories in which a legendary figure resolves a long-standing conjecture, much as they enjoy tales of heroes and dragons. This is probably how Hilbert’s name first reached the wider public: David Hilbert (1862-1943) was the most celebrated mathematician of his era. In 1900, Hilbert assembled 23 mathematical problems that were then unresolved. Some were sharply defined (Problem 8, for exampl ...
HyKGE: Knowledge-Graph-Enhanced RAG for Medical LLMs
Introducing HyKGE This article draws on “HyKGE: A Hypothesis Knowledge Graph Enhanced Framework for Accurate and Reliable Medical LLMs Responses,” by Xinke Jiang, Ruizhe Zhang, Yongxin Xu, Rihong Qiu, and other researchers at Peking University’s School of Computer Science. HyKGE is a recent approach to combining knowledge graphs (KGs) with retrieval-augmented generation (RAG). It pairs the semantic understanding and generative abilities of large language models (LLMs) with the rich, structured information stored in knowledge graphs. The result can make medical-information retrieval more efficient while keeping answers accurate. This work opens another path for medical LLMs and offers useful lessons for applying large language models and knowledge graphs in a wider range of settings. R ...
Uncertainty Quantification with Spatiotemporal Graph Probabilistic Models
Author: Zhang Yixian Reviewer: Shiguang Introduction Spatiotemporal data are complex and diverse. Analyzing them can have a major impact on weather forecasting (as with Huawei’s Pangu model), predictions of geological variation and sunspot activity, traffic-light scheduling, bike-sharing deployment, and many other tasks. Their complexity arises from variation across time and space as well as spatial heterogeneity. Their distributions can also be extreme, with large numbers of zero values and pronounced long tails. This article introduces a method that uses the Tweedie distribution and the zero-inflated negative binomial distribution to capture zero inflation and long-tail effects in complex spatiotemporal data, then combines these distributions with a spatiotemporal graph neural net ...



























