tromp

21 ms·

331.
by tromp 1y ago
https://archive.is/UHvzt
332.
by tromp 1y ago
> In the Callas Normal Form, the factors are integers p = 2^{n-1} and q = 2^{m+1}, where n ≤ m, and p and q are ideally prime, but don’t have to be. The paper's formatting clearly went wrong here, as it should have read p = 2^n - 1
333.
by tromp 1y ago
After using CLEAR, some already dropped pieces might be left unsupported. I think CLEAR should not only clear completed rows, but also detect these pieces and let them drop down.
334.
by tromp 1y ago
You can visibly send BTC to the Liquid federated side-chain, where amounts in txs are hidden.
335.
by tromp 1y ago
It's more fair if every generation gets to mine the same amount. You want supply to be predictable and for the inflation rate to go steadily down, but there's not much point in limiting the supply [1]. [1] https://tromp
336.
by tromp 1y ago
It's such a shame that the premier cryptocurrency chose a speculation friendly emission that concentrated wealth on early adopters (its creator included) rather than a speculation resistant pure linear emission (no halvings) that would
337.
by tromp 1y ago
> run by the far-right (e.g. Italy, Hungary, Slovakia, the Netherlands), Since the far right PVV stepped out of the Dutch governing coalition, they should now be placed with the centrists/conservatives.
338.
by tromp 1y ago
It's funny how the author fails to apply the XOR trick in the two missing values problem: > We can thus search for u by applying this idea to one of the partitions and finding the missing element, and then find v by applying it to t
339.
by tromp 1y ago
https://archive.is/BaiNB
340.
by tromp 1y ago
Except it's not useless. It's use is to enrich its creators.
341.
by tromp 1y ago
I can't help wondering how big a cube you'd need to fill it with 1 million $1 coins. 43x43 piles of 541 coins each make 1000309 coins with a pile height of 541*2mm = 1.082m, while the width would be somewhat less than 43*26.5mm =
342.
by tromp 1y ago
> BYD, China’s biggest EV maker, famously sells the Seagull hatchback for under $10,000 domestically. It costs around $26,000 in Europe, where it recently debuted. BYD started a price war in China by selling these cars near or even below
343.
by tromp 1y ago
https://archive.is/4jfFi
344.
by tromp 1y ago
It looks like the authors of [3] misunderstood Chaitin. What Chaitin said about the limits of provability is that no statements of the form "K(x) > c_F" can be proven in formal system F where c_F is some constant depending on F
345.
by tromp 1y ago
Thanks for sharing; your post would fit well as an answer to mine about Graham's number...
346.
by tromp 1y ago
That entirely depends on how you want to interpret a finite binary string as an enumeration of logic proofs?!
347.
by tromp 1y ago
If we assume ZFC to be consistent, then Gödel's 2nd incompleteness theorem tells us that it cannot prove its own consistency. So in particular it cannot prove than TM_ZFC_INC will never halt.
348.
by tromp 1y ago
People on the bbchallenge Discord server are keen to speculate on how many Turing Machine states are needed to surpass Graham's Number, which is vastly larger than the 2^^2^^2^^9 achieved by the latest BB(6) champion. We know from the
349.
by tromp 1y ago
What makes BB(748) independent of ZFC is not its value, but the fact that one of the 748-state machines (call it TM_ZFC_INC) looks for an inconsistency (proof of FALSE) in ZFC and only halts upon finding one. Thus, any proof that BB(748) =
350.
by tromp 1y ago
How are they more successful than Renaissance Technologies?
351.
by tromp 1y ago
Correct article: https://archive.is/ByOCT
352.
by tromp 1y ago
https://archive.is/HMeeN
353.
by tromp 1y ago
> 2:48 the fact that we're not using gravity Of course you're using gravity on a device built out of little slopes, just as the Turing Tumble is. Add a hand-cranked marble lift to a Turing Tumble and the two are much more simil
354.
by tromp 1y ago
https://archive.is/j9K8D
355.
by tromp 1y ago
> Even what tromp is saying is quite strange to me Indeed I mis-spoke. While for all n, PA can prove P(n), it cannot prove "for all n: P(n)". I don't know if there is a name for this, but it's not an omega-inconsisten
356.
by tromp 1y ago
> > If PA proves "PA proves X" then PA can prove X. If we assume PA to be sound, then indeed everything it proves is true. > Not true. Now you're saying PA is unsound. But your article wasn't about PA proves &qu
357.
by tromp 1y ago
There's this $5000 hamburger: https://www.de-daltons.com/the-golden-boy/
358.
by tromp 1y ago
Can easily happen when you make repeated edits.
359.
by tromp 1y ago
https://archive.is/os3ew
360.
by tromp 1y ago
When Kolmogorov complexity is expressed directly in terms of the pure untyped lambda calculus, the oldest and simplest model of computation (except perhaps for SK combinatory logic, which is less expressive bit-for-bit), you cannot really c

More ›