5 citations · 15 across the 11 of their papers we have counts for
5 papers · 1 filter
The Collatz 3n+1 Conjecture is Unprovable
Craig Alan Feinstein
In this paper, we show that any proof of the Collatz 3n+1 Conjecture must have an infinite number of lines; therefore, no formal proof is possible.
Machine-Checked Formalization of Earlier Arguments on versus Using Isabelle/HOL
Craig Alan Feinstein
This letter revisits an earlier argument concerning versus based on the SUBSET-SUM problem and examines its formalization in Isabelle/HOL. The formal dev…
The Riemann Hypothesis is Unprovable
Craig Alan Feinstein
In this note, we give a simple proof that the Riemann Hypothesis is unprovable in any reasonable axiom system.
Is it possible to compute the Moebius function without factoring?
Craig Alan Feinstein
It has been well known since Fermat's Little Theorem was first published that it is possible to determine that a number is composite without determining any of its nontrivial facto…
A mathematical definition of "simplify"
Craig Alan Feinstein
Even though every mathematician knows intuitively what it means to "simplify" a mathematical expression, there is still no universally accepted rigorous mathematical definition of…