tromp

50 ms·

721.
by tromp 2y ago
https://www.wired.com/1997/01/did-gates-really-say-640k-is-e...
722.
by tromp 2y ago
https://archive.is/hqzOz
723.
by tromp 2y ago
https://archive.is/qP9GN
724.
by tromp 2y ago
https://archive.is/WOhGB
725.
by tromp 2y ago
Referential transparency is a big feature in that it hugely aids in reasoning about your program. I agree that it takes away the power of making your code hard to reason about:-)
726.
by tromp 2y ago
By then you have a Haskell, which unlike LISP is just syntactic sugar on a typed lambda calculus.
727.
by tromp 2y ago
If you consider it lacking in I/O, then it takes very little to add conventions for those. E.g. the Binary Lambda Calculus is a programming language [1]. [1] https://www.ioccc.org/2012/tromp/hint.htm
728.
by tromp 2y ago
Between lambda calculus and LISP, I find LISP to be the ugly one, not only because of its far greater complexity, but also its lack of referential transparency. David Turner / Ben Lynn make some good observations about LISP in section
729.
by tromp 2y ago
A more extensive analysis of Nash equilibria including a numerical solution for the full game is presented in https://bowaggoner.com/blahg/2024/09-06-adversarial-binary-s...
730.
by tromp 2y ago
> I still have issues with practical examples like the above. What issues would those be? Do you see that λf.λx.n f(f x)) is the Church numeral n+1 ? I think there's few better ways to grok lambda calculus than working through examp
731.
by tromp 2y ago
> it gives you utilities such as Rc, Arc and Cow to do reference counting and “clone-on-right” Not quite right: [1] https://en.wikipedia.org/wiki/Copy-on-write
732.
by tromp 2y ago
Note that with the standard representation of natural numbers in lambda calculus, the Church numerals [1], you don't even need the Y combinator to implement factorial: fac = λn.λf.n(λf.λn.n(f(λf.λx.n f(f x))))(λx.f)(λx.x) For
733.
by tromp 2y ago
Only for up to 5 numbers. Note that the Nash equilibrium for 100 numbers could require many pages to describe.
734.
by tromp 2y ago
> Out of the 100 numbers, there are 32 that would require you to ask 6 questions to make a guess. Huh? I have 100 - (1+2+4+8+16+32) = 100 - 63 = 37, where 2^i numbers can be guessed after exactly i wrong guesses plus one correct guess.
735.
by tromp 2y ago
He didn't need to mention it because it's implicit in data flow. Instead of the side effecting / state changing whip(cream) that needs to be under flow control, you have whipped_cream = whip(cream) describin
736.
by tromp 2y ago
It causes huge problems for the freshwater fish. Even regular use of the Ijmuiden sluices lets enough salt water leak into the North Sea canal that it causes problems for which technical mitigations are being developed.
737.
by tromp 2y ago
https://archive.is/lUEdO
738.
by tromp 2y ago
I applaud the effort, but https://chessdream.vercel.app/about fails to explain what this site offers that the leading platform lichess.com and chess.com (which have huge leads in community sizes) don't.
739.
by tromp 2y ago
Just find an archive link in the comments to bypass the paywall, or post one yourself by visiting e.g. https://archive.is/ and pasting the link in the bottom box "I want to search the archive for saved snapshots".
740.
by tromp 2y ago
For the price of launching one mirror, you can surely build orders of magnitude more solar panels plus batteries compared to whatever solar power the mirror adds? Even if some fool would pay thousands to enjoy sunlight at night, what if clo
741.
by tromp 2y ago
I wonder how this compares to the https://en.wikipedia.org/wiki/ZX_Spectrum_Next
742.
by tromp 2y ago
See https://tromp.github.io/pearls.html for suggested changes to make thus run with modern compilers.
743.
by tromp 2y ago
With my 1988 IOCCC entry char*M,A,Z,E=40,J[40],T[40];main(C){for(*J=A=scanf(M="%d",&C); -- E; J[ E] =T [E ]= E) printf("._"); for(;(A-=Z=!Z) || (p
744.
by tromp 2y ago
I've been trying to fit Loader's number, winner of the BIGNUM BAKEOFF contest [1], into a tweet (280 bytes). Yesterday, I finally succeeded [2]. Btw, I just noticed that Bignum Bakeoff has the same acronym as Busy Beaver. How appr
745.
by tromp 2y ago
Loads fine on my macOS 10.15.7 on all of FireFox, Chrome, Brave, and Safari.
746.
by tromp 2y ago
Wrong. Some other cryptos do highlight their trade-offs. E.g. google "This isn’t to say Grin is better than others, it simply makes different tradeoffs."
747.
by tromp 2y ago
https://archive.is/a7wEk
748.
by tromp 2y ago
My homepage [1] shows two different kinds of code as art. One is this ┬────────── ┼─────┬──── ┼─────┼─┬── │ ──┬─┼ ┼ ┬ │ ┬─┼─┼ │ │ │ │ ├─┘ │ │ │ ├─┘ │ │ └─┤ │ │ └─────┤ │ └─┘ graph
749.
by tromp 2y ago
Old standards like RSA and ECDSA re based on the presumed classical hardness of the discrete log / hiddden subgroup problem, which is known to be quantum easy. New ones are based on lattice shortest vector problems, which are presumed
750.
by tromp 2y ago
https://archive.is/B1BjC

More ›