tromp

31 ms·

511.
by tromp 2y ago
Ah, that explains why I thought I was getting very lucky to be able to get a hole in 3, and shortly afterwards, even a hole in 2. Is it possible to get a hole in 1, or are levels constructed so as to prevent that?
512.
by tromp 2y ago
Elaine Benes would be proud of their writing...
513.
by tromp 2y ago
> So instead of writing one interpreter, we are going to write four, with increasing performance and complexity. I went in the other direction, and wrote a BF interpreter of reduced complexity and performance in Haskell, that translates
514.
by tromp 2y ago
Haskell provides https://hackage.haskell.org/package/base-4.21.0.0/docs/Data-...
515.
by tromp 2y ago
Annoyingly ambiguous title; guess they want you to read the article to find out if hanging out is harmful, or hanging out less is.
516.
by tromp 2y ago
The fully qualified type is traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b) and deriving it for your own types is as simple as data MyType ... = ... deriving (Traversable)
517.
by tromp 2y ago
https://archive.is/u82Lc
518.
by tromp 2y ago
https://archive.is/xbNna > With the help of a mathematical model that linked size with age, they estimated that one sixteen-foot female was at least two hundred and seventy-two years old, and possibly as much as five hun
519.
by tromp 2y ago
I would have expected the language documentation to focus more on this observation and to explain for instance how self modification is used to implement while loops. But I don't even see the term mentioned anywhere?!
520.
by tromp 2y ago
Am I right in deducing that this language gets its power from self-modifying code? I.e. flipping bits within addresses of the opcodes of the running program?
521.
by tromp 2y ago
If the IOCCC description [1] doesn't make it clear enough, perhaps this explanation [2] does it better? I also link to a Pi Day 2023 talk trying to explain it on my lambda playground page [3]. [1] https://www.ioccc.org/
522.
by tromp 2y ago
I wasn't just claiming Turing completeness of Haskell. I was pointing out that every language construct, every subexpression in Haskell, directly represents a corresponding lambda term, with corresponding semantics (e.g. laziness).
523.
by tromp 2y ago
> Whilst it certainly isn't a contender for modern programming languages Yet all that separates the λ-calculus from one modern programming language, Haskell, is a layer of syntactic sugar on top, and a runtime that effectuates its p
524.
by tromp 2y ago
It doesn't work on modern Apple Silicon macs with M1-4 chips (although Rosetta [1] might be able to handle it somehow), but it works fine on my older x86 based iMac. [1] https://en.wikipedia.org/wiki/Rosetta_(softw
525.
by tromp 2y ago
Binary Lambda Calculus uses de-Bruijn indices [1], thereby avoiding the need for alpha renaming. [1] https://en.wikipedia.org/wiki/De_Bruijn_index
526.
by tromp 2y ago
My IOCCC entry [1] explains exactly what the 43-byte program is. It's a self-interpreter for BLC8, the byte based version of Binary Lambda Calculus. The 521 byte interpreter on the other hand is written in x86 assembly, a language much
527.
by tromp 2y ago
You see them everywhere in Holland, e.g. this one https://www.veloretti.com/products/mini-kids Of course, putting the pedals back on can be difficult with these...
528.
by tromp 2y ago
> The dunk-and-spin maneuver is risky, Yarger notes, as roughly one in every four dragonflies eventually drowns. It's not that risky, with about a 99.99% success rate. But in their lifespan of a few weeks, they will still be doing t
529.
by tromp 2y ago
I think Wikipedia [1] explains it better than this article. [1] https://en.wikipedia.org/wiki/Treewidth
530.
Fake police knock on man's door at 2am(dailydot.com)
2 points by tromp 2y ago|1 comments
531.
by tromp 2y ago
https://archive.is/OCqfu
532.
by tromp 2y ago
I'm sure it's finite given the finite capacity of the car battery (or fuel tank).
533.
by tromp 2y ago
> Consider an irrational number, where the fastest possible algorithm (given a standard Turing machine) to compute its nth digit requires (10^(10^100))*(n+1) operations There can be no such number. You can always make a Turing machine ou
534.
by tromp 2y ago
https://archive.is/f8smi
535.
by tromp 2y ago
Oh, that was easier than expected: 1. e4 e5 2. Qh5 a6 3. Bc4 a5 4. Qxf7# I assume a mate in 3 (or a Fool's mate in 2) is not possible...
536.
by tromp 2y ago
Nice find. I tried to get an even shorter mate, but its tendency to give up its pieces got in the way: 1. e4 e5 2. Bc4 Bc5 3. Qh5 Bxf2+ 4. Ke2 Bxg1 5. Qxf7# Can anyone get a mate in 4?
537.
by tromp 2y ago
That's some impressive code wizardry! I thought the 2-ply search would make it respond to a mate-in-1 threat, but the following game demonstrates otherwise: 1. e4 e5 2. Nf3 Nf6 3. Nxe5 Nxe4 4. Qe2 Nxd2 5. Nc6+ Ne4 6. Qxe4+ Qe7 7. Nxe7
538.
by tromp 2y ago
https://archive.is/t3h4a
539.
China's Economy Is Burdened by Years of Excess(wsj.com)
4 points by tromp 2y ago|1 comments
540.
by tromp 2y ago
This is used to represent number in the bruijn programming language [1] [2]. [1] https://text.marvinborner.de/2023-04-06-01.html [2] https://bruijn.marvinborner.de/

More ›