TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Is Hacker News Turing Complete?

2 pointsby LangIsAllWeNeedabout 2 years ago
Assume we have a news aggregator, N, and a comments section, C. --Let Q be any computable function. ---We can construct a program, P, that uses N and C to simulate Q as follows: 1) Parse news articles with N. 2) Use the comments section, C, to filter out irrelevant information. 3) Rely on smart commentators to provide input on how to manipulate the remaining data to generate an output that simulates Q. ---Since we could simulate any computable function with P, the system consisting of N and C is Turing complete<p>All we need is sharp commentators and some clean code snippets, and we could create a Turing-complete machine that can solve any computable problem I think.

no comments

no comments