jamster02

18 ms·

1. 1.▲
   by jamster02 9mo ago

   > the Unicode string "√5" is representable as 4 UTF-8 bytes As the other person pointed out, this is representing an irrational number unambiguously in a finite number of bits (8 bits in a byte). I fail to see how your original
2. 2.▲
   by jamster02 11mo ago

   I also recently ran into a problem when unit testing and monkey patching where I had to import after monkey patching, so in the function itself.
3. 3.▲
   by jamster02 1y ago

   The fact that it is no longer peasant food doesn't consciously play any part in that.
4. 4.▲
   by jamster02 2y ago

   I appreciate even more ideas to work with. A more "working" proof language sounds interesting. While I agree that Rocq is decidably not for a "working programmer," I've had a lot of fun working through the book &quo
5. 5.▲
   by jamster02 2y ago

   I appreciate the resources and recommendations. I've been interesting in Rocq (formerly Coq) recently, and I've seen dependent types mentioned, so I've been curious to learn more.
6. 6.▲
   by jamster02 2y ago

   Regex isn't (necessarily) turing complete :) > Because our program just consists of a sequence of regular expressions, you can't loop at all! That, technically, means we can't actually perform Turing Complete But we can do