Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2201.09801

A logical treatment of noise: Solving The Hardest Logic Puzzle Ever and its generalizations

Daniel Vallstrom
View original source ↗Read source document ↗Export metadata ↓

Abstract

Raymond Smullyan came up with a puzzle that George Boolos called The Hardest Logic Puzzle Ever.[1] The puzzle has truthful, lying, and random gods who answer yes or no questions with words that we don't know the meaning of. The challenge is to figure out which type each god is. The puzzle has attracted some general attention -- for example, one popular presentation of the puzzle has been viewed 10 million times.[2] Various "top-down" solutions to the puzzle have been developed.[1,3] We present a systematic bottom-up approach to the puzzle and its generalization. We prove that an n gods puzzle is solvable if and only if the random gods are less than the non-random gods, for arbitrary cardinals. We develop a solution using 4.15 questions on average to the 5 gods variant with 2 random and 3 lying gods. We introduce an algorithm and an implementation for finding solutions to the generalized problem, together with upper bounds. Finally, we note that random gods act like noisy sources, which provides a connection to fault-tolerant computing.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel Vallstrom. 2026-05-29. A logical treatment of noise: Solving The Hardest Logic Puzzle Ever and its generalizations. https://arxiv.org/abs/2201.09801

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the convergence of a perturbed one dimensional Mann's process

We study a perturbed version of Mann's iterative process (DMP), defined by \[ x_{n+1} = (1 - θ_n)x_n + θ_n f(x_n) + r_n, \] where $f: [0,1] \to [0,1]$ is a continuous function, $\{θ_n\} \subset [0,1]$ is a given sequence, and $\{r_n\} $ represents an error term. We prove that if the sequence $\{θ_n\} $ converges sufficiently slowly to zero and the error term $ r_n $ is suitably small at infinity, then any sequence $\{x_n\} \subset [0,1] $ generated by this process converges to a fixed point of $f$. In addition, we investigate the asymptotic behavior of the trajectories $ x(t) $ as $ t \to \infty$ for a continuous-time version of the process (DMP). We emphasize the parallels between the discrete and the continuous dynamics. Furthermore, through numerical experiments, we analyze the influence of the sequence $\{θ_n\} $ and the error terms on the stability and the convergence rate of the the discrete and the continuous processes. Notably, we observe that the (DMP) algorithm, when affected by stochastic and relatively large error terms, can outperform the bisection method in efficiently identifying the fixed point set of the function $f$.

math.GM↗
arXiv2026

Explicit formula for the discrete Laplace transform of the Möbius function, related special functions, and a criterion for the Riemann hypothesis

In this paper, we assume that all the zeros of the Riemann zeta function are simple. Under this assumption we give an explicit formula for the function $Φ(e^{-t})=\sum_{n=1}^{\infty}μ(n)e^{-nt}$, as a function of the values of $ζ(s)$ and $ζ'(s)$ at the odd integers and as a function of the zeros of $ζ(s)$. A structural feature distinguishes this formula from the classical explicit formula for the Mertens function: the poles of $Γ(s)$ collide with the trivial zeros of $ζ(s)$, producing double poles whose residues contain a logarithmic term. Using this formula, we give a criterion for the Riemann hypothesis: the bound $O(x^{-1/2})$ on the transform implies the Riemann hypothesis unconditionally, while the converse direction requires additional hypotheses on the zeros. We also introduce special entire functions related to $ζ(s)$ and show that they admit absolutely convergent closed forms as Möbius-weighted series of Bessel functions of rotated argument.

math.GM↗
arXiv2026

There exist blow-ups in the incompressible Navier-Stokes equation

In this paper, we solve the Navier-Stokes equation, one of the seven Millennium Prize Problems suggested by Clay Mathematics Institute(CMI). In our paper, the fluid is confined in a solid sphere. We prove that, for any initial velocity u0, there has been a force vector f , such that there exists no smooth solution (p,u) to the respective Navier-Stokes equation. This result also holds for the Euler equation. The paper was first published in 2021, soon after, Professor PG Lemarié-Rieusset contact me and tell that there is a possible flaw, because u may be non-integrable when it decreases not very fast. Hence, I withdraw the paper. Through carefull consideration of several years, we think we can choose a fluid confined in a solid sphere to fix it. So, we update the paper now.

math.GM↗