tromp

12 ms·

211.
by tromp 11mo ago
The irony of forcing the use of a name "AA" instead of your legal name "A" causing problems for your AAdvantage rewards program...
212.
by tromp 11mo ago
The European tarriffs on Chinese EVs typically amount to 20%, which doesn't keep them out but does somewhat slow their adoption.
213.
by tromp 11mo ago
> Christopher Wadsworth analyzed different properties of numeral systems and the requirements they have to fulfill to be useful for arithmetic. > Specifically, he calls a numeral system adequate if it allows for a successor (succ) fun
214.
by tromp 11mo ago
Thanks for the live link, which really should have been on that website! Btw, currently in round 3, I only see table 2 being broadcast. It's interesting to see the world championship continue after the game was solved in 2023 [1]. [1]
215.
by tromp 11mo ago
https://archive.is/r5RVo
216.
by tromp 11mo ago
> Living to 150 is definitely realistic > In a few years, this will be the reality. With the oldest person alive at age 116, it won't be a reality for another 34 years. > In five to 10 years, nobody will get cancer It's h
217.
by tromp 11mo ago
https://archive.is/Ar71i#selection-537.0-537.44
218.
XPeng Gears Up to Launch Robotaxis Next Year(wsj.com)
1 points by tromp 11mo ago|1 comments
219.
by tromp 11mo ago
> I tested it in my drive above in a Mona 1, which starts 119,000 Chinese yuan (about $17,000 USD). > Meanwhile, Tesla FSD costs $10,000 on top of the price of the vehicle you are going to use it in, which starts at roughly $37,000 fo
220.
I rode in Xpeng's $20,000 Tesla FSD competitor(electrek.co)
3 points by tromp 11mo ago|1 comments
221.
by tromp 1y ago
Haskell
222.
by tromp 1y ago
https://archive.is/mJseT
223.
by tromp 1y ago
ASML must have done extensive research on X-ray based lithography, before deciding that EUV is the better option to pursue, despite the huge technological hurdles the latter entails. Why would the trade-offs look different for Substrate? Ha
224.
by tromp 1y ago
I do not predict that. We just need the bet to have a time limit because BB(7) will always have holdouts as long as I live. I chose 10 years because I have prior experience with that timeframe [1]. [1] https://senseis.xmp.net&#x2
225.
by tromp 1y ago
The 79-bit lambda term λ1(λλ2(λλ3(λ312))(1(λ1)))(λλ1)(λλ211)1 in de-Bruijn notation exhibits f_ε0 growth without all the complexities of computing Kirby-Paris hydra or Goodstein sequences. Even that is over 60% larger than the 49-bit Graham
226.
by tromp 1y ago
The BB function does grow mind bendingly fast. The machine running for 2↑↑2↑↑2↑↑9 steps is one of the 4^12*23836540 = 399910780272640 differently behaving 6-state machines [1]. A similarly fast growing function is the functional busy beaver
227.
by tromp 1y ago
Wren ties with Phix for most tasks done on Rosetta Code [1]. [1] https://rosettacode.org/wiki/Rosetta_Code/Rank_languages_by_...
228.
by tromp 1y ago
> The image itself piCore-16.0.0.img is only 101MB in size, which is really small compared to Ubuntu server > is this the smallest possible OS out there? The answer to this is: no, but the alternatives are to use stripped back version
229.
by tromp 1y ago
https://archive.is/QUPwI
230.
by tromp 1y ago
You're right; I should have said "In a sense" instead of "actually", since I consider the less common bloat in codesize rather than the more common bloat in features.
231.
by tromp 1y ago
It's possible that I messed up in transcribing from my working code K = A (A A) (A (A A) A A A A A); S = A (A (A A (A A (A A))(A (A (A A (A A)))))) A A; that assumes application is left associative. > So, something like thi
232.
by tromp 1y ago
Yes; that's sort of how the lambda calculus self-interpreter works. There's another connection too, where a lambda term is obtained from its binary code by successive applying an initial term to true or false [1]. [1] https:&#x2F
233.
by tromp 1y ago
My uni.c was based on Ben Lynn's combinatory logic VM to which he compiled a large subset of Haskell [1] in a winning IOCCC entry. Lennart Augustsson made an even more comprehensive Haskell implementation with a combinator based runtim
234.
by tromp 1y ago
The name for a dummy argument that is not used. We could also write A as \x y z => x z (y (K z)), since K is the const function that ignores its second argument and returns the first.
235.
by tromp 1y ago
A french company is developing similar technology called PERS (pedaling energy recovery system) [1] that is actually chainless. This comparison [2] claims an overall efficiency of around 64%, with both generator and motor losing about 20% e
236.
by tromp 1y ago
let A = (x) => (y) => (z) => x(z)(y((w) => z)) Just need to combine this a few times. let K = A(A(A))(A(A(A))(A)(A)(A)(A)(A); // (x) => (y) => x let S = A(A(A(A)(A(A)(A(A)))(A(A(A(A)((A(A)))))
237.
by tromp 1y ago
> Code review becomes your post-game analysis. Magnus reviews his games with engines to learn from their superior analysis. You review LLM code to ensure it's actually correct. If AI coding assistents really worked like Chess engine
238.
by tromp 1y ago
I would say a hard recall rather than a soft recall (which technically is still an actual recall).
239.
by tromp 1y ago
A blockchain can use Merkle trees in several ways. First, the block header usually contains the Merkle root of all transactions. This makes the header, and in turn the Proof-of-Work, commit to all txs, which helps make the chain immutable.
240.
by tromp 1y ago
> there exists a term x that satisfies Ax = B Don't you mean xA = B ? > x can just disregard A and return B Not if you require x to be strict, i.e. it must use its argument.

More ›