tromp

14 ms·

271.
by tromp 1y ago
> There is no reachable chess position with more than 218 moves. "no more than 218 possible next moves" would be a lot clearer... > By checking all approximately 8.7x10^45 reachable chess positions? That's a large overe
272.
by tromp 1y ago
> Pascal contends that a rational person should adopt a lifestyle consistent with the existence of God and should strive to believe in God. The reasoning for this stance involves the potential outcomes: if God does not exist, the believe
273.
by tromp 1y ago
According to the definition of a tuple above, a 1-tuple <a> is λx. x a. So <a> is a function that applies its argument to a.
274.
by tromp 1y ago
This is a great introduction to that most ancient and elegant model of computation. But I was a little sad to read: > One can represent natural numbers in a simple way, as follows: > Definition (ordered tuples, natural numbers) The or
275.
by tromp 1y ago
Unfortunately no mention of the most important spec, particularly for AI: the memory bandwidth.
276.
by tromp 1y ago
The Rat of the Deal...
277.
by tromp 1y ago
They didn't. You confused reports that a majority of parliament wants to do so.
278.
by tromp 1y ago
While bitcoin script is a stack language, it doesn't really qualify as Forth as it doesn't allow you to define any new words.
279.
by tromp 1y ago
Bond yield is the return an investor will realize on a bond, so driving down prices decreases yields. Sure, it can increase the absolute value of yield as it heads into the negative...
280.
by tromp 1y ago
I wanted to check the prime factors of 1966 the other day so I googled it and it led me to https://brightchamps.com/en-us/math/numbers/factors-of-1966 , a site that seems focussed on number facts. It confiden
281.
by tromp 1y ago
Watch the 2024 finals in action: https://www.youtube.com/watch?v=Zafp5yTKCyA&t=225s
282.
by tromp 1y ago
Hard to break the cycle with the broken first-past-the-post voting system.
283.
by tromp 1y ago
https://tromp.github.io/cl/cl.html has many links to BLC materials, like my LispNYC video talk.
284.
by tromp 1y ago
The first 5 values are FAR easier to determine, since there's only 1 lambda term of at most 5 bits:-) And the next few unknown values, BBλ(37).. BBλ(39) will be easier to determine too since the search space is smaller and no so-called
285.
by tromp 1y ago
Wolfram's exploration of longest lifetimes of lambda terms of a given size is carried out more systematically in my functional busy beaver https://oeis.org/A333479
286.
by tromp 1y ago
More discussion at https://news.ycombinator.com/item?id=45288161
287.
by tromp 1y ago
They didn't claim that. They claimed that any (sound and consistent) finitely axiomatizable theory (basically, any recursively enumerable set of theorems) can only prove finitely many theorems of the form BB(n) = N.
288.
by tromp 1y ago
Yes, there are deciders for all finite sets of TMs. You just cannot have one for all TMs.
289.
by tromp 1y ago
If you count arbitrary transition tables, then you get a count of 63403380965376 [1]. If you count transition tables in which states are reachable and canonically ordered, then you get a count of 632700 * 4^10 = 663434035200 [2]. These mach
290.
by tromp 1y ago
> In OCaml for instance, unit corresponds to void. It makes more sense that Void should be void of values, i.e correspond to the empty set, as it does in Haskell [1]. Does OCaml have no empty type? [1] https://hackage.haskell.
291.
by tromp 1y ago
With a coefficient of 0.219, they're not even in the top 10 on that metric. China seems to be making the most aerodynamic cars now: 0.191 Dongfeng Xinghai S7 0.194 XPeng Mona M03 0.195 Xiaomi SU7 Pro 0.197 Lucid Air Pure I'm looki
292.
by tromp 1y ago
The 2024 Prius has a drag coefficient of 0.27 (slightly worse than the previous generation's 0.26), which compares poorly with the Model 3's 0.22.
293.
by tromp 1y ago
Amethyst-Cat apparently erased their github account, but the internet archive still has one snapshot [1]. The pdf link from there redirected to the davidtpeng account, but that github user no longer has a ChessComplexity repo and the inte
294.
by tromp 1y ago
The 115x was obtained by doing a (less plausable) large amount of optimization...
295.
by tromp 1y ago
It's hard to get a super compact eval for LISP with its many primitives. It's somewhat easier for the lambda calculus which inspired LISP, with obnly the 3 primitives of variable, abstraction, and application. In the binary lambda
296.
by tromp 1y ago
or Haskell
297.
by tromp 1y ago
In the alternative Mimblewimble protocol, there is no possibility of this happening, as not only the sender, but also the receiver has to sign for a transfer of funds.
298.
by tromp 1y ago
I forgot to add the atom boolean to the nil representation. I made some changes that hopefully fix that.
299.
by tromp 1y ago
A black hole is no more a perfect sphere than a sun is. Would gravity from the nearest other black hole not have a deforming effect of at least 2^-64 ?
300.
by tromp 1y ago
Looking at file church.scm from the provided zip file [1], I see the following functions used to construct lists: (define kons (lambda (x) (lambda (y) ((pair false) ((pair false) ((pair x) y)))))) (define kar (lambda

More ›