5 citations · 15 across the 11 of their papers we have counts for
11 papers
Dialogue Concerning The Two Chief World Views
Craig Alan Feinstein
In 1632, Galileo Galilei wrote a book called \textit{Dialogue Concerning the Two Chief World Systems} which compared the new Copernican model of the universe with the old Ptolemaic…
2-State 3-Symbol Universal Turing Machines Do Not Exist
Craig Alan Feinstein
In this brief note, we give a simple information-theoretic proof that 2-state 3-symbol universal Turing machines cannot possibly exist, unless one loosens the definition of "univer…
The Computational Complexity of the Traveling Salesman Problem
Craig Alan Feinstein
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.
An Elegant Argument that P is not NP
Craig Alan Feinstein
In this note, we present an elegant argument that P is not NP by demonstrating that the Meet-in-the-Middle algorithm must have the fastest running-time of all deterministic and exa…
Complexity Science for Simpletons
Craig Alan Feinstein
In this article, we shall describe some of the most interesting topics in the subject of Complexity Science for a general audience. Anyone with a solid foundation in high school ma…
Trapping Regions for the Navier-Stokes Equations
Craig Alan Feinstein
In 1999, J.C. Mattingly and Ya. G. Sinai used elementary methods to prove the existence and uniqueness of smooth solutions to the 2D Navier-Stokes equations with periodic boundary…