This post introduces timecond, a TypeScript library I created to represent, evaluate, and describe complex conditions on time ranges. The support for time ranges is what makes it different from many other popular time scheduling libraries that focus on events (points in time). Note In contrast to all my prior …| dr knz @ work
On November 17th, 2012, a link to a Brainfuck interpreter written using the C preprocessor language was posted to Hacker News. In the necessary flurry of HN comments that followed, the question of CPP’s Turing Completeness came up, to be answered negatively: the proposed interpreter needs to be extended …| dr knz @ work
Two days ago I started to investigate whether C was Turing Complete. With help from two serious people also interested in the topic, I came to the preliminary conclusion that it is probably not. Here is a summary of the arguments so far. Turing Completeness is a property of languages …| dr knz @ work
Ivan Godard from Out-of-the-Box Computing is currently touring the US talking about his Mill CPU architecture, based on a new machine model called the “Belt”. I just finished watching the 2nd talk on the machine model and its realization in the processor’s micro-architecture. OotB’s contribution is a machine …| dr knz @ work
Note The latest version of this document can be found online at https://dr-knz.net/on-the-future.html. Alternate formats: Source, PDF. Prologue A famous researcher once said that a scientist should not work more than 5-6 years in the same research area. The argument had something to do with losing …| dr knz @ work
Using Emacs and advanced Emacs customization for editing Go.| dr knz @ work
Hillel proposed on Twitter today: “Expressiveness” is how easily we can ‘do’ things in a system. “Tractability” is how easily we can assert properties on things we ‘do’. F.ex DFAs are tractable, Turing machines are expressive. The expressiveness vs tractability tradeoff is one of the most fundamental in CS …| dr knz @ work