tromp

16 ms·

301.
by tromp 1y ago
Perhaps people would be more likely to give the correct answer if "at least one of them is a girl" is rephrased as the equivalent "the youngest is a girl or the oldest is a girl".
302.
by tromp 1y ago
O() doesn't necessarily describe worst-case behaviour. It just provides an asymptotic upper bound. So a quadratic sorting algorithm can still be said to be O(n^3), although that might be a little misleading.
303.
by tromp 1y ago
It's been shown to be surpassed at n=150, which as you note is likely very generous. Hypertree would typically only require a few more states. Hypertree doesn't grow meaningfully faster than Tree. Hypertree(3) is what would be cal
304.
by tromp 1y ago
Beyond BBλ2(10^100), there is no larger number with complexity under 10^100.
305.
by tromp 1y ago
> it makes other "googology" numbers vanish by comparison. I consider TREE to be medium sized in the googology universe. It obliterates Graham's Number of course, as well as Goodstein sequence and simple hydras. But it&#x2
306.
by tromp 1y ago
> Police said the gold bars were used to convert the illicit crypto funds into a tangible commodity that the scammers could move across borders without being detected. That makes no sense at all, since crypto moves across borders far mor
307.
by tromp 1y ago
The parent suggested that the number couldn't be encoded due to its largeness rather than its value. So while any number n with Kolmogorov complexity K(n) > 10^100 cannot be recursively encoded in the known universe, that number n n
308.
by tromp 1y ago
https://archive.is/VOMfH
309.
by tromp 1y ago
The CoC implementation includes inductive types, so is this an implementation of CiC, the Calculus of Inductive Constructions, with the same proving power as Lean?
310.
The Babson Task has been achieved in an endgame study(en.chessbase.com)
1 points by tromp 1y ago|0 comments
311.
by tromp 1y ago
User skarz did indeed ask an LLM, which got [flagged] since the LLM gave a distinctly worse answer. Expand the [9 more] below to see it.
312.
by tromp 1y ago
No, it's not 6 blocks longer. It just needs to be 1 longer (i.e. 7 blocks since the last common block), which guarantees a higher cumulative difficulty and thus all honest miners will switch to the new branch, obsoleting 6 blocks on th
313.
by tromp 1y ago
https://en.wikipedia.org/wiki/List_of_most_massive_black_hol... shows the maximal theoretical limit as 270B solar masses.
314.
by tromp 1y ago
TIL that NBI stands for Non-Biological Intelligence.
315.
by tromp 1y ago
Not to be confused with any of https://en.wikipedia.org/wiki/Q_(programming_language_from_K... https://en.wikipedia.org/wiki/Q_Sharp https://q-lang.sourceforge.net/qdoc.pdf
316.
by tromp 1y ago
https://archive.is/nx580
317.
by tromp 1y ago
41/38 ~ 1.08, so it's 8% more likely rather than 3%.
318.
by tromp 1y ago
How does "a very small (hence Pico), very simple, yet very secure encryption tool" come to depend on OpenGL, threatening its future on MacOS?
319.
by tromp 1y ago
https://archive.is/U512Q
320.
by tromp 1y ago
https://archive.is/qCo9V
321.
by tromp 1y ago
Regarding the last problem, a weak nation will be invaded iff there are an odd number of strong nations.
322.
by tromp 1y ago
Lambda Diagrams originally appeared at [1]. [1] https://tromp.github.io/cl/diagrams.html
323.
by tromp 1y ago
A similar implementation of a large subset of Haskell was done by Ben Lynn in a winning IOCCC entry as described at [1]. The graph reduction engine is the small C programs shown in [2]. A much larger and more production-ready implementation
324.
by tromp 1y ago
Working on my MacOSX Brave...
325.
by tromp 1y ago
https://archive.is/BgKoW
326.
by tromp 1y ago
If you had both Omega and the halting probability Omega_1 of a Universal Oracle Turing Machine with Omega as oracle, then it seems you could decide Sigma_2/Pi_2 conjectures. You can alternate bits from both Omegas to make it one number
327.
by tromp 1y ago
only the truth of finitely refutable conjectures...
328.
by tromp 1y ago
> each pixel having both a foreground and a background colour how does that work?
329.
by tromp 1y ago
https://archive.is/oWZ1D
330.
by tromp 1y ago
https://archive.is/GPBTF

More ›