norvid_studies @norvid_studies
— web clipping, 872 words — published 2026-08-05
3 captures, most recent first. Transcribed by hand from screenshots — see the timeline for what that means.
norvid_studies @norvid_studies
— web clipping, 872 words — published 2026-08-05
norvid_studies @norvid_studies
— quoting Yuxi on the Wired (@layer07_yuxi) replying to @Algon_33
A tweet drawing an analogy between the historical "gates have errors, so computation is fundamentally limited" objection to classical computers (resolved by von Neumann's threshold theorem) and the modern objection to LLMs (attributed to LeCun) that per-token error probability compounds and caps reliable output length. Relevant to Nathan's interest in AI capability trajectories and arguments about LLM reliability limits.
llm reliabilityvon neumann threshold theoremyann lecunai capabilitiescomputer science historytwitter
norvid_studies @norvid_studies
A trivial, unrelated joke tweet about the spelling of "brussels sprouts" — no substantive content connecting to the archive's themes.