tromp

16 ms·

241.
by tromp 1y ago
Chess.com coverage at https://www.chess.com/news/view/grandmaster-daniel-naroditsk... ChessBase coverage at https://en.chessbase.com/post/daniel-naroditsky-1995-2
242.
by tromp 1y ago
Having Amiga legend Dave Haynie on the team also helps inspire confidence.
243.
by tromp 1y ago
The above code should work for any number of digits. It follows the spec given in the article, specifically: 1. Write out all but the last digit of the card number. 2. Write out all but the last digit of the card number. 3.
244.
by tromp 1y ago
> have all lambdas upfront and only composition in the body That is only possible for a very limited subset of lambda terms. For example, it's not possible for the one-point basis A = λx λy λz. x z (y (λw. z)) from which an
245.
by tromp 1y ago
Expressed in Haskell: import Data.Char card = "4024 6072 3695 0748" cardDigits = map digitToInt . filter (not . isSpace) doubleDigitSum d = 2 * d - if d<5 then 0 else 9 doubleEveryOther = reverse . zip
246.
by tromp 1y ago
Simple pure concatenative languages map quite well though [1]. [1] https://github.com/tromp/AIT/blob/master/ait/mlatu.lam
247.
by tromp 1y ago
I implemented the Calculus of Constructions in untyped lambda calculus in order to shorten the 643 byte C program computing Loader's Number to 1850 bits (under 232 bytes) [1], as one of the milestones reached by my functional busy beav
248.
Sodium batteries are finally catching up(sciencedaily.com)
27 points by tromp 1y ago|12 comments
249.
by tromp 1y ago
This is both the Church encoding and the Scott encoding of the abstract data type data Bool = True | False making it pretty much the only encoding you find in the literature. This is quite different from the case of the natural num
250.
by tromp 1y ago
https://archive.is/AF2yq
251.
by tromp 1y ago
There are other functions MyBool a -> MyBool a, such as not = \b x y -> b y x.
252.
by tromp 1y ago
No instance for (Eq (MyBool a0 -> a0 -> a0 -> a0)) arising from a use of ‘==’ Undecidability of function equality aside, we could indeed define "myIf = id" instead.
253.
by tromp 1y ago
For lambda calculus, the motto is "when everything is a function". The boolean true is the function λx.λy.x, while false is λx.λy.y. If b then x else y then simply becomes b x y. In a functional language like Haskell that is basic
254.
by tromp 1y ago
https://archive.is/L1a2q
255.
by tromp 1y ago
With possibly more cases outside Korea: > My understanding is that most of Tesla’s vehicles sold in Korea are made at Gigafactory Shanghai in China, and that’s Tesla’s main export hub. Most of Tesla’s vehicles outside of the US are made
256.
The EPA Hasn't Released a Toxicity Report on this Forever Chemical(propublica.org)
23 points by tromp 1y ago|0 comments
257.
How the United States is eating Trump's tariffs(reuters.com)
18 points by tromp 1y ago|3 comments
258.
by tromp 1y ago
Reminds me of the 1 million pound first solution prize Eternity puzzle ... https://en.wikipedia.org/wiki/Eternity_puzzle
259.
by tromp 1y ago
Wilson's algorithm is based on so-called loop-erased random walks [1]. [1] https://en.wikipedia.org/wiki/Loop-erased_random_walk
260.
by tromp 1y ago
Because you cannot trust the answers AI gives. It presents hallucinated answers with the same confidence as true answers (e.g. see https://news.ycombinator.com/item?id=45322413 )
261.
by tromp 1y ago
I'm competing on Which country will click the least? but some may find the following more interesting: Which country will click the averagest?
262.
by tromp 1y ago
The bottom of my home page has this as a PostScript signature: %!PS % -John Tromp http://tromp.github.io/ /t{dup 1 sub gsave dup 0 gt{[.4 .2 -.2 .4 .4 .2]concat t currentgray .8 mu
263.
by tromp 1y ago
8726713169886222032347729969256422370854716254 is an unrestricted upper bound proven in the ChessPositionRanking project.
264.
by tromp 1y ago
It's conceivable that the maximum number of plies (half-moves) you need is 218. The best known lower bound on needed number of plies is 185 for "Harry Goldsteen's furthest position" https://timkr.home.xs4all.n
265.
by tromp 1y ago
I assume superko as is standard in several rulesets to prevent infinite play.
266.
by tromp 1y ago
White cannot play on the last empty point as this would be suicide, which is prevented by the (assumed) superko rule forbidding repetition of the empty position.
267.
by tromp 1y ago
Meanwhile, for the game of Go, as played on a standard 19x19 board, we have: The maximum number of possible next moves is 361, which happens only in the initial empty position. The 361 hardest-to-reach positions (assuming logical rules like
268.
by tromp 1y ago
The black b2 pawn has no moves in the position with white to move. If it were black's move, it would still have no moves since it is pinned by the white queen on e5. If it were not pinned it would have 4 moves, as it can also underprom
269.
by tromp 1y ago
The phrasing "Legal but non-reachable " makes clear that they use some notion of legal that differs from the normal one of reachability. It's hard to imagine what sensible notion that could be though. Something like: each sid
270.
by tromp 1y ago
That's ceil(log2(~4.8x10^44)) = 149 bits. But to make it efficiently decodable you'd use the ceil(log2(8726713169886222032347729969256422370854716254)) = 153 bit representation of the ChessPositionRanking project linked to in my o

More ›