tbct

6 ms·

1. 1.▲
   by tbct 10mo ago

   Can you elaborate on what you're referring to? I can see performance becoming a problem if you repeatedly chain non-optimisable (in bytecode) as excluding the in place operations I believe all ops re-allocate the collection.
2. 2.▲
   by tbct 1y ago

   David Autor was recently interviewed by Martin Wolf on the effect of AI on jobs. The question of if its fair to compare a possible economic shock on knowledge work to the China shock in manufacturing. He had two responses to the question: 1
3. 3.▲
   by tbct 1y ago

   Once you have algebraic data-types in a language, writing a recursive visitor pattern is pretty simple. Encoding the semantics of a tree traversal operator likewise is difficult in the general case. What exactly would the order be, what if
4. 4.▲
   by tbct 2y ago

   Surely, however from a software architecture perspective types as contracts, assuming pure functions and maximally restrictive types, is a good model for reasoning about a system. A function such as: addIfEven: Int -> Int -> Maybe Int
5. 5.▲
   by tbct 2y ago

   Surprisingly one of the best summaries (~10 pages) to applied linear algebra I've found is in Nielsen and Chuang's Quantum Computation and Quantum Information. Presented primarily without proofs which whilst argubably can be limit