tromp

6 ms·

31.
by tromp 4mo ago
https://en.wikipedia.org/wiki/Capture_the_flag_(cybersecurit... still has no mention of AI, but that will likely change as they increasingly dominate competition.
32.
by tromp 5mo ago
The author presents most known numeral systems (ways of representing natural numbers) in lambda calculus, classified by whether the term use their bound variables exactly one time (linear), at most one time (affine), or multiple times (non-
33.
by tromp 5mo ago
> The task is to place four black queens and one black bishop on the chessboard so that there is no square not under their attack. In other words, after arranging the five black pieces, it must be impossible to place the white king anywh
34.
by tromp 5mo ago
> fly two to three times faster (about 460 miles per hour, compared to 90 miles per hour) Is this AI math? That's over 5 times faster.
35.
by tromp 5mo ago
> Next Friday always means the Friday after the next one You're using "the next one" i.e. the next Friday, to refer to the first one after today.
36.
by tromp 5mo ago
Except on Friday's, when "this Friday" means today. On other days, many people indeed use "this" and "next" synonymously.
37.
by tromp 5mo ago
> The Simple Rule > If the Friday you’re referring to is beyond seven days from today, including today, it’s next Friday. That's not a such simple rule. I'm not even sure what "including today" means. A simple rule
38.
by tromp 5mo ago
One of the smallest implementations is my heavily obfuscated https://www.ioccc.org/2012/tromp/ : Int L[A],m,b,*D=A, *c,*a=L,C,*U=L,u;s (_){u--&&s(a=*a);}
39.
by tromp 5mo ago
> Alonzo Church developed the lambda calculus in 1929. His first publication that showed the elements of the lambda calculus was the 1932 paper "A set of postulates for the foundation of logic", as I cited in my recent paper [1
40.
by tromp 5mo ago
The build process: https://www.youtube.com/watch?v=HzI2GgTZAfE
41.
by tromp 5mo ago
Design of this (not quite) unpickable lock: https://www.youtube.com/watch?v=-qUu8kIliy8
42.
by tromp 5mo ago
> import Control.Monad (guard) > "fizz" <$ guard (rem i 3 == 0) I prefer the more transparent if i `mod` 3 == 0 then Just "fizz" else Nothing
43.
by tromp 5mo ago
But the value of a 51% attack is roughly proportional to marketcap, so while they are cheaper to attack, there's less incentive for the attack. The most (relatively) vulnerable coins are those where the daily dollar value is low relati
44.
by tromp 5mo ago
By having a small daily dollar value (the column "PoW Produced (24h) in [1]). All but the top 15 coins sorted by that column have less than $10k emitted per day in block rewards, which limits the power that miners can spend on competin
45.
by tromp 5mo ago
Correct; both Bitcoin and Monero use Hashcash as PoW, only differing in the choice of hash function. Verification is only different from a solution attempt in asymmetric (i.e. non-Hashcash) PoW, such as Cuckoo Cycle or (the poorly named) Eq
46.
by tromp 5mo ago
A similar Haskell success story (from Bellroy) is the subject of an upcoming Melbourne Compose meeting: https://luma.com/uhdgct1v
47.
by tromp 5mo ago
> just none are good for you and all lead to a loss given perfect play. That's exactly what it means to be in a lost position; all moves lose. A lost position is only Zugzwang though if the same position with the opponent to move is
48.
by tromp 5mo ago
While normal Go allows passing one's turn, and thus has no zugzwang, there is a No Pass Go variant [1] that forbids passing, where the first player in zugzwang loses the game. [1] https://senseis.xmp.net/?NoPassGo
49.
by tromp 5mo ago
You run out of time on your clock. If you press your clock without moving, the opponent will alert the referee to sort you out. And if you play without a clock, your opponent will get annoyed at you taking forever to move.
50.
by tromp 5mo ago
> In 2010, Prime Minister David Cameron told an Indian television show that returning the diamond would set a dangerous precedent. “What tends to happen with these questions is that, if you say yes to one, you suddenly find the British M
51.
by tromp 5mo ago
You left out the crucial bit: Worse: this flow runs entirely through Google Play Services, not the Android OS. Google can change it, tighten it, or kill it at any time, with no OS update required and no consent needed. And as of t
52.
by tromp 5mo ago
Does that mean that in rayiner's phrasing [1], you'd argue for "cooperating" with the other head shooters? [1] https://news.ycombinator.com/item?id=47913066
53.
by tromp 5mo ago
https://archive.is/QF8fI
54.
by tromp 5mo ago
I should really try out a Helix ( https://helix.ca/ ) next time I visit Canada.
55.
by tromp 5mo ago
I've known about Mahjong for decades but TIL it has many similarities to a game I play regularly, Rummykub. https://en.wikipedia.org/wiki/Rummikub describes it as combining elements of the card game rummy and Mahj
56.
by tromp 5mo ago
I find the interaction net model of computation fascinating in its elegance and efficiency. And so I very much appreciate Taelin's company making efficient and highly concurrent implementations for both CPUs and GPUs. Unfortunately, my
57.
by tromp 5mo ago
The corresponding repo https://github.com/VictorTaelin/LamBench describes this as: λ-bench A benchmark of 120 pure lambda calculus programming problems for AI models. → Live results What is this?
58.
by tromp 5mo ago
Since they said "the corresponding polynomial", they must mean the mapping between the colored hexagons and the knot polynomials.
59.
by tromp 5mo ago
Needing 20,000 attempts to find one of 65,173 possible keys is not a convincing demonstration of running Shor's algorithm.
60.
by tromp 5mo ago
Turn on Reader Mode in your browser (called Speedreader in Brave) to avoid the very poor contrast.

More ›