HackerTubeHN

explainer · HACKER NEWS RECOMMENDATION

P vs. NP and the Computational Complexity Zoo

hackerdashery · 4 HN recommenders · 5 recommendation months

YouTube

Recommended by 4 Hacker News commenters across 5 months (2015–2026).

SignalTube analysis

Among 6 other explainer videos tagged Computability & complexity theory, the mean is 3.7 distinct HN recommenders. This video has 4 distinct HN recommenders, close to that mean. Recommendations span 5 distinct months; the peer average is 3.5 months. This is a data-derived comparison, not a human review or quality rating.

63% of its 8 labeled comments are marked as recommendations or strong recommendations. HN mention years are 2015–2026; those years describe discussion history, not upload date. A verified runtime is not present in the current metadata snapshot. A verified YouTube publication date is not present in the current metadata snapshot.

Channel / speaker
hackerdashery
Verified runtime
Not verified in the current YouTube metadata
YouTube upload date
Not verified
Hacker News mention years
2015–2026

SAME TOPIC AND FORMAT

Compare with related videos

6 peers

The comparison cohort uses other explainer videos in Computability & complexity theory. “Shared recommenders” counts HN users who recommended both videos in the source graph.

VideoHN recommendersRecommendation monthsPositive label shareShared recommendersRuntimeUpload date
P vs. NP and the Computational Complexity ZooCurrent video4563%—Not verified in the current YouTube metadataNot verified
Math's Fundamental Flawexplainer · Veritasium7747%No recorded overlapNot verifiedNot verified
All the Numbers - Numberphileexplainer · Numberphile6658%No recorded overlapNot verifiedNot verified
What P vs NP is actually aboutexplainer · Polylog43100%No recorded overlapNot verifiedNot verified

THREE SOURCE-BASED CONTEXT POINTS

Why Hacker News recommends it

8 mentions

Each note combines the dataset’s stance label and short rationale; comment bodies are not reproduced. Open the HN source for the original discussion.

reference2026-07Original HN comment ↗

The archive classifies this as a contextual reference in “Markets are competitive if and only if P = NP”. Its short rationale: Cited as explanation of P and NP.

strong rec2023-05Original HN comment ↗

The archive classifies this as a strong recommendation in “Problems harder than NP-Complete”. Its short rationale: Overview of complexity classes and relation to reality.

reference2019-04Original HN comment ↗

The archive classifies this as a contextual reference in “Do you believe in P = NP? – the 3. PollPaper [pdf]”. Its short rationale: Listed as additional related item.