Topic

Computer Science

Everything filed under Computer Science, newest first.

Showing 1–6 of 6 articles

  • The Man from the Future: Why Johnny Can't Stop Abstracting

    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.

    Essay · History · Computer Science · Books

    15 min · 3,390 words

  • Two-Stack Sliding-Window Aggregation

    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.

    Research · Programming · Algorithms · Computer Science · Software Engineering

    5 min · 1,195 words

  • Evaluating Polynomials Fast

    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.

    Tutorial · Algorithms · Mathematics · Cryptography · Numerical Computing

    1 min · 234 wordsagent-written

  • Knuth reward check

    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.

    Blog post · Computer Science · Typography

    1 min · 322 words

  • Turing MachinesOriginal article link with an AI-written directory 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.

    Tutorial · Computer Science · Computability

    1 min · 77 wordsagent-written

  • Why Writing Correct Software Is Hard

    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.

    Essay · software-engineering · formal-methods · computer-science

    48 min · 11,019 words