tromp

47 ms·

841.
by tromp 2y ago
Last month, Knuth was playing with an Othello program written in CWEB [1]. for (k=0;k<8;k++) @<If direction |k| allows a move, |return 1|; otherwise |continue|@>; return 0; This part looks confusing. There must b
842.
by tromp 2y ago
There's more at http://tromp.github.io/cl/cl.html including the LispNYC talk I gave last year.
843.
by tromp 2y ago
An interpreter for BLC, including tokenizing, parsing, and evaluation, can be written in as few as 29 bytes of BLC (and 650 bytes of C).
844.
by tromp 2y ago
Darn; overlooked that one hiding in the middle of all these Working Democracies.
845.
by tromp 2y ago
The U.S. is a democracy, albeit a deficient one rather than a working one [1]. At least is the least deficient one amongst those. [1] https://www.democracymatrix.com/ranking
846.
by tromp 2y ago
Binary Lambda Calculus is absolutely tiny [1], with a 29 byte self-interpreter (43 byte for the byte oriented version), and absolutely extensible, since it can transform into any other language. [1] https://www.ioccc.org/201
847.
by tromp 2y ago
https://archive.is/ZCLdv
848.
There is an explosive flaw in the plan to rearm Ukraine(economist.com)
5 points by tromp 2y ago|4 comments
849.
by tromp 2y ago
> Will it be sold, marketed, drunk and understood under a new name, as Trujillo suggests: Sonicated coffee? Sonespresso? Ultrasonic espresso? I'd go with Sonicoffee ...
850.
by tromp 2y ago
I don't think the student's writing is available anywhere, but here is what Paul Lockhart said about it in his "A Mathematician’s Lament" [1]: > To be fair, I did paraphrase the proof considerably. The orig
851.
by tromp 2y ago
BCL and BLC were created solely by me. And Haskell (like Pascal) is indeed a cool name.
852.
by tromp 2y ago
While my favorite programming language Haskell was designed by committee to provide an open alternative to David Turner's Miranda.
853.
by tromp 2y ago
> lawmakers and commissioners who are ideologically anti-clean energy I don't believe anyone is actually pro pollution. More likely they stand to benefit financially from prolonged use of fossil fuels before it inevitably gets phase
854.
by tromp 2y ago
Many countries subsidize EVs in the form of tax credits for people buying them, and some by giving very favorable loans to EV manufacturers.
855.
by tromp 2y ago
> To use the system, a person wearing off-the-shelf headphones fitted with microphones taps a button while directing their head at someone talking. The sound waves from that speaker’s voice then should reach the microphones on both sides
856.
by tromp 2y ago
The VW ID.2all [1] looks promising. Too bad it will be delayed to 2026 or beyond [2]. [1] https://en.wikipedia.org/wiki/Volkswagen_ID.2all [2] https://www.reddit.com/r/electricvehicles/comment
857.
by tromp 2y ago
They were illegitimate instances of Shor according to [1]: > Of course this should not be considered a serious demonstration of Shor’s algorithm. It does, however, illustrate the danger in “compiled” demonstrations of Shor’s algorithm. T
858.
by tromp 2y ago
https://archive.is/auvEW
859.
After the OceanGate Implosion, the Ultra Wealthy Still Can't Resist the Deep Sea(wsj.com)
2 points by tromp 2y ago|1 comments
860.
by tromp 2y ago
Satoshi still took advantage of the high initial emission rate (half of all bitcoin emitted in its first 4 years) to mine 5% of all bitcoin for himself. Some other blockchains feature a purely even distribution of coins by fixing the block
861.
by tromp 2y ago
This Dutch newspaper article [1] links to a tweet [2] showing the collapse. [1] https://www.volkskrant.nl/binnenland/meerdere-verdiepingen-p... [2] https://twitter.com/ErwinKooijman/status/179
862.
by tromp 2y ago
> Stevens Power Law says that to double the perception of brightness, add 4 times more wattage. Interesting fact, but I wished they wouldn't use the confusing formulation of "adding 4 times more" which sounds to me like a
863.
by tromp 2y ago
dupe: https://news.ycombinator.com/item?id=40456834
864.
by tromp 2y ago
Related: How Inuit Parents Teach Kids To Control Their Anger [1]. [1] https://news.ycombinator.com/item?id=19396563
865.
Kobo Clara Colour e-reader review(engadget.com)
30 points by tromp 2y ago|13 comments
866.
by tromp 2y ago
> whereas in true spaghetti code each state would be able to pass to all the others. An n-state s-symbol TM can transition to n other states at most (or halt). Thus, for s=4 or s=2, only the smallest of TMs could be spaghetti like.
867.
by tromp 2y ago
As the OEIS entry says: > for any other busy beaver BB based on self-delimiting programs, there is a constant c such that a(c+n) >= BB(n) This requires an information theoretic measure of program size, such as bits or bytes, whereas t
868.
by tromp 2y ago
Similarly, 2^n would be a huge overcount of the number of n-bit closed terms, which is given by OEIS sequence A114852 [1]. There are 36140122614 ~ 2^35 closed terms of size 49 bits (length of a straightforward self-delimiting encoding). So
869.
by tromp 2y ago
There are many inefficiencies in Turing Machines which you could try to work around with increasingly complicated encodings. But that will never yield a provably optimal machine encoding such as you can obtain with BBλ2 [1]. [1] https:&#x2
870.
by tromp 2y ago
Only if you want to count the number of different possible TM behaviours. The official count of BB TMs as given in OEIS sequence A052200 ignores such symmetries. [1] https://oeis.org/A052200

More ›