Înapoi la articole →

Cel mai recent articol

Ultima verificare

Urmăritori 0 urmăritori
Articole: 14
  1. Computers Cannot Multiply

    What would you call a function that is incorrect 99.999999% of the time?

  2. Aphorisms

    Something that has worked well for me several times (twice so far) is coming up with a catchy aphorism and then getting other people to write about it.

  3. 1–10+K Decks

    (Extracted from a rambling email I sent to Raymond Lee, 22nd Feb 2024.)

  4. Here is a somewhat-new theory about the so-called “Mamluk playing cards” which I think shines light on the way the deck was constructed.

  5. Interruption Testing

    This post is an attempt to capture a general description of a simple testing technique I have encountered in a few guises — and “Interruption testing” is my attempt to give it a name.

  6. (Bad) Poems about NZ Beers

    (Apologetically occasioned by Chris Tse’s tweets 1, 2.)

  7. History of Programming Language Topics

    Inspired by Cajori’s A History of Mathematical Notations, and/or TV Tropes.

  8. Cheap model-based testing with F# & FsCheck

    This is a blog version of a talk that I did ~2015 in Auckland.

  9. Managing Multiplicity

    Alternate titles: Purging Pluralities, Collapsing Cardinality.

  10. Ignore Null Strategies

    There’s no such thing as a null strategy!

  11. This question was recently asked on StackOverflow: I know this might seem like an absolutely silly question to ask, yet I am too curious not to ask… Why did “i” and “j” become THE variables to use as counters in most control structures?

  12. “Purity”

    (Originally posted on StackOverflow.)

  13. Today, thanks to user Lucero on StackOverflow, I learned about .NET’s “Balancing Groups” Regex feature.

  14. Debugging Turing: an excursion with Scheme

    So, I thought it would be a fun idea for my first ever Lisp/Scheme program to implement Alan Turing’s original a-machines from his paper, On Computable Numbers, with an Application to the Entscheidungsproblem (paper available to public).