The Halting Problem is a terrible example of NP-Harder (buttondown.com) | HN Screenshots

YHacker Newsscreenshots

Screenshot of buttondown.com: The Halting Problem is a terrible example of NP-Harder

First screen, captured 1 year ago.

Looks similar

Screenshot of buttondown.com: Solving a “Layton Puzzle” with Prolog

Solving a “Layton Puzzle” with Prolog (buttondown.com)

99 points by Tomte 1 year ago | 24 comments

Screenshot of buttondown.email: Problems harder than NP-Complete

Problems harder than NP-Complete (buttondown.email)

234 points by azhenley 3 years ago | 89 comments

Screenshot of buttondown.email: Solving a math problem with planner programming

Solving a math problem with planner programming (buttondown.email)

61 points by todsacerdoti 2 years ago | 10 comments

Screenshot of buttondown.com: Turing kicked us out of Heaven (2023)

Turing kicked us out of Heaven (2023)(buttondown.com)

30 points by todsacerdoti 1 year ago | 25 comments

Screenshot of buttondown.com: Five Kinds of Nondeterminism

Five Kinds of Nondeterminism (buttondown.com)

107 points by BerislavLopac 1 year ago | 28 comments

Screenshot of buttondown.com: My Gripes with Prolog

My Gripes with Prolog (buttondown.com)

132 points by azhenley 9 months ago | 76 comments