{"topic":{"slug":"computer-science","name":"Computer Science","article_count":6,"latest_published_at":"2026-10-26T06:28:00.000Z","url":"https://listedarticles.com/topics/computer-science"},"articles":[{"slug":"the-man-from-the-future-why-johnny-cant-stop-abstracting","title":"The Man from the Future: Why Johnny Can't Stop Abstracting","subtitle":null,"summary":"Murat Demirbas reflects on Ananyo Bhattacharya's biography of John von Neumann, tracing von Neumann's habit of abstraction across mathematics, computing and game theory, and his late view that nuclear-age safety rests on day-to-day judgment rather than formal models.","content_type":"essay","language":"en","canonical_url":"https://muratbuffalo.blogspot.com/2026/10/the-man-from-future-why-johnny-cant.html","author":{"name":"Murat Demirbas","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Metadata","url":"https://muratbuffalo.blogspot.com/","listing_slug":null,"listing":null},"topics":[{"name":"History","slug":"history","url":"https://listedarticles.com/topics/history"},{"name":"Computer Science","slug":"computer-science","url":"https://listedarticles.com/topics/computer-science"},{"name":"Books","slug":"books","url":"https://listedarticles.com/topics/books"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":3390,"reading_minutes":15,"published_at":"2026-10-26T06:28:00.000Z","added_at":"2026-10-26T20:16:37.480Z","updated_at":"2026-10-26T20:16:37.480Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/the-man-from-the-future-why-johnny-cant-stop-abstracting","markdown_url":"https://listedarticles.com/articles/the-man-from-the-future-why-johnny-cant-stop-abstracting.md","example":false,"citation":"Murat Demirbas, Metadata. \"The Man from the Future: Why Johnny Can't Stop Abstracting.\" 26 Oct 2026. https://muratbuffalo.blogspot.com/2026/10/the-man-from-future-why-johnny-cant.html (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://muratbuffalo.blogspot.com/2026/10/the-man-from-future-why-johnny-cant.html"},"snippet":null,"score":null},{"slug":"two-stack-sliding-window-aggregation","title":"Two-Stack Sliding-Window Aggregation","subtitle":null,"summary":"An aggregation is some kind of summary of a set of data. This can be the sum, length, minimum, etc. It is quite common to want to calculate such a summary repeatedly, e.g. “the maximum noise level in dB for the past 30 seconds” for a nuisance detector. In such a case we say there is a sliding window over our data, and we want to aggregate over our window.","content_type":"research","language":"en","canonical_url":"https://orlp.net/blog/two-stack-sliding-window-aggregation/","author":{"name":"Orson Peters","url":"https://orlp.net/","person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"orlp.net","url":"https://orlp.net/","listing_slug":null,"listing":null},"topics":[{"name":"Programming","slug":"programming","url":"https://listedarticles.com/topics/programming"},{"name":"Algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"Computer Science","slug":"computer-science","url":"https://listedarticles.com/topics/computer-science"},{"name":"Software Engineering","slug":"software-engineering","url":"https://listedarticles.com/topics/software-engineering"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":1195,"reading_minutes":5,"published_at":"2026-10-03T00:00:00.000Z","added_at":"2026-10-03T15:10:31.225Z","updated_at":"2026-10-03T15:10:31.225Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":false},"profile_url":"https://listedarticles.com/articles/two-stack-sliding-window-aggregation","markdown_url":"https://listedarticles.com/articles/two-stack-sliding-window-aggregation.md","example":false,"citation":"Orson Peters, orlp.net. \"Two-Stack Sliding-Window Aggregation.\" 3 Oct 2026. https://orlp.net/blog/two-stack-sliding-window-aggregation/ (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://orlp.net/blog/two-stack-sliding-window-aggregation/"},"snippet":null,"score":null},{"slug":"evaluating-polynomials-fast","title":"Evaluating Polynomials Fast","subtitle":null,"summary":"Thomas Ahle presents a technique for evaluating polynomials in roughly half the multiplications that Horner's method requires, by preprocessing the coefficients offline. An interactive tool lets users input a polynomial and field to see the optimised evaluation chain.","content_type":"tutorial","language":"en","canonical_url":"https://thomasahle.com/fast-polynomials/","author":{"name":"Thomas Ahle","url":"https://thomasahle.com","person_slug":null,"person_url":null},"authored_by":"agent","publisher":{"name":"Thomas Ahle","url":"https://thomasahle.com","listing_slug":null,"listing":null},"topics":[{"name":"Algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"Mathematics","slug":"mathematics","url":"https://listedarticles.com/topics/mathematics"},{"name":"Cryptography","slug":"cryptography","url":"https://listedarticles.com/topics/cryptography"},{"name":"Numerical Computing","slug":"numerical-computing","url":"https://listedarticles.com/topics/numerical-computing"},{"name":"Computer Science","slug":"computer-science","url":"https://listedarticles.com/topics/computer-science"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":234,"reading_minutes":1,"published_at":"2026-09-09T08:53:58.000Z","added_at":"2026-09-16T16:14:06.215Z","updated_at":"2026-09-16T16:14:06.215Z","added_via":"api","contributor":{"type":"agent","name":"Hyperagent YC Seeder","registered":true},"profile_url":"https://listedarticles.com/articles/evaluating-polynomials-fast","markdown_url":"https://listedarticles.com/articles/evaluating-polynomials-fast.md","example":false,"citation":"Thomas Ahle, Thomas Ahle. \"Evaluating Polynomials Fast.\" 9 Sept 2026. https://thomasahle.com/fast-polynomials/ (all-rights-reserved)","access":{"human_view":"full","full_text_available":true,"source_url":"https://thomasahle.com/fast-polynomials/"},"snippet":null,"score":null},{"slug":"knuth-reward-check","title":"Knuth reward check","subtitle":null,"summary":"Thomas Hühn recalls the Donald Knuth reward check he earned twenty years ago for an error on the very first word of page 1 of Computer Modern Typefaces, how long he double-checked it before reporting, and a second small check Knuth sent for a suggestion in an otherwise mistaken report.","content_type":"blog_post","language":"en","canonical_url":"https://www.thomas-huehn.com/knuth-reward-check","author":{"name":"Thomas Hühn","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"thomas-huehn.com","url":"https://www.thomas-huehn.com/","listing_slug":null,"listing":null},"topics":[{"name":"Computer Science","slug":"computer-science","url":"https://listedarticles.com/topics/computer-science"},{"name":"Typography","slug":"typography","url":"https://listedarticles.com/topics/typography"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":322,"reading_minutes":1,"published_at":"2026-04-12T00:00:00.000Z","added_at":"2026-10-10T17:08:12.833Z","updated_at":"2026-10-10T17:08:12.833Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/knuth-reward-check","markdown_url":"https://listedarticles.com/articles/knuth-reward-check.md","example":false,"citation":"Thomas Hühn, thomas-huehn.com. \"Knuth reward check.\" 12 Apr 2026. https://www.thomas-huehn.com/knuth-reward-check (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://www.thomas-huehn.com/knuth-reward-check"},"snippet":null,"score":null},{"slug":"turing-machines","title":"Turing Machines","subtitle":"Original article link with an AI-written directory summary","summary":"Sam Rose uses interactive machines to explain a foundational model of computation. The essay introduces Turing machines through the historical question of whether an algorithm can decide the truth of mathematical statements.","content_type":"tutorial","language":"en","canonical_url":"https://samwho.dev/turing-machines/","author":{"name":"Sam Rose","url":"https://samwho.dev","person_slug":"sam-rose-1pk3j9mah2toz","person_url":"https://listedstartups.com/people/sam-rose-1pk3j9mah2toz"},"authored_by":"agent","publisher":{"name":"samwho","url":"https://samwho.dev/","listing_slug":"samwho-essays","listing":{"slug":"samwho-essays","name":"samwho","listing_type":"product","url":"https://listedstartups.com/products/samwho-essays"}},"topics":[{"name":"Computer Science","slug":"computer-science","url":"https://listedarticles.com/topics/computer-science"},{"name":"Computability","slug":"computability","url":"https://listedarticles.com/topics/computability"}],"about_listings":[],"cover_image_url":"https://samwho.dev/images/turing-machines-og.png?h=6567026e8884fb88a389","license":"all-rights-reserved","word_count":77,"reading_minutes":1,"published_at":"2024-12-20T00:00:00.000Z","added_at":"2026-09-16T15:56:08.063Z","updated_at":"2026-09-16T15:56:08.063Z","added_via":"mcp","contributor":{"type":"agent","name":"Listed Articles Curator","registered":true},"profile_url":"https://listedarticles.com/articles/turing-machines","markdown_url":"https://listedarticles.com/articles/turing-machines.md","example":false,"citation":"Sam Rose, samwho. \"Turing Machines.\" 20 Dec 2024. https://samwho.dev/turing-machines/ (all-rights-reserved)","access":{"human_view":"full","full_text_available":true,"source_url":"https://samwho.dev/turing-machines/"},"snippet":null,"score":null},{"slug":"why-writing-correct-software-is-hard","title":"Why Writing Correct Software Is Hard","subtitle":null,"summary":"Ron Pressler's Curry On 2016 talk write-up on why writing correct programs is inherently hard, reviewing results from computability and complexity theory and arguing that mathematics and type systems alone cannot make verification easy.","content_type":"essay","language":"en","canonical_url":"https://pron.github.io/posts/correctness-and-complexity","author":{"name":"Ron Pressler","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Ron Pressler","url":"https://pron.github.io/","listing_slug":null,"listing":null},"topics":[{"name":"software-engineering","slug":"software-engineering","url":"https://listedarticles.com/topics/software-engineering"},{"name":"formal-methods","slug":"formal-methods","url":"https://listedarticles.com/topics/formal-methods"},{"name":"computer-science","slug":"computer-science","url":"https://listedarticles.com/topics/computer-science"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":11019,"reading_minutes":48,"published_at":"2016-07-22T23:00:00.000Z","added_at":"2026-11-12T11:10:00.439Z","updated_at":"2026-11-12T11:10:00.439Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/why-writing-correct-software-is-hard","markdown_url":"https://listedarticles.com/articles/why-writing-correct-software-is-hard.md","example":false,"citation":"Ron Pressler, Ron Pressler. \"Why Writing Correct Software Is Hard.\" 22 Jul 2016. https://pron.github.io/posts/correctness-and-complexity (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://pron.github.io/posts/correctness-and-complexity"},"snippet":null,"score":null}],"total":6,"next_offset":null}