Recent Computability & complexity theory on HN

Computability & complexity theory is a topic archive of videos linked in Hacker News comments. This snapshot contains 34 videos and 240 labeled comments across 2008–2026. That is an average of 7.1 linked comments per video. The summed 131 recommender entries are counted per video, so one HN user can appear in more than one topic video.

This page answers “what surfaced more recently?”: videos are sorted by their latest Hacker News mention year. For a different question—“which talks have the most distinct recommenders?”—use the topic's Best Talks list when at least 20 talks are available. This topic has 8 cataloged talks. Its average per-video recommender count is 3.9; neither this metric nor recency represents YouTube views or a quality rating.

Topic labels follow the published taxonomy and may overlap. Use the filters to narrow by format, learning level, catalog shelf life, or how many distinct months a video received recommendations. Open a video record to compare it with same-topic videos and inspect its underlying HN context.