Did Turing prove the undecidability of the halting problem? (arxiv.org) | HN Screenshots

YHacker Newsscreenshots

Screenshot of arxiv.org: Did Turing prove the undecidability of the halting problem?

First screen, captured 2 years ago.

Looks similar

Screenshot of arxiv.org: Conway and Doyle can divide by three, but I can't

Conway and Doyle can divide by three, but I can't (arxiv.org)

48 points by worez 3 years ago | 7 comments

Screenshot of arxiv.org: Grothendieck’s use of equality

Grothendieck’s use of equality (arxiv.org)

172 points by golol 2 years ago | 110 comments

Screenshot of projecteuclid.org: The halting problem is decidable on a set of asymptotic probability one (2006)

The halting problem is decidable on a set of asymptotic probability one (2006)(projecteuclid.org)

138 points by Schiphol 3 years ago | 106 comments

Screenshot of arxiv.org: A SAT Attack on Tarski's High School Algebra Problem

A SAT Attack on Tarski's High School Algebra Problem (arxiv.org)

87 points by matt_d 2 months ago | 35 comments

Screenshot of arxiv.org: A convex polyhedron without Rupert's property

A convex polyhedron without Rupert's property (arxiv.org)

23 points by robinhouston 1 year ago | 3 comments

Screenshot of arxiv.org: Tiling with Three Polygons Is Undecidable

Tiling with Three Polygons Is Undecidable (arxiv.org)

122 points by denvaar 1 year ago | 25 comments