Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Straw
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
31.
▲
by
Straw
1y ago
In the theoretical section, they extrapolate assuming a polynomial from 40 to thousands of dimensions. Why do they trust a polynomial fit to extrapolate two orders of magnitude? Why do we even think it's polynomial instead of exponenti
32.
▲
by
Straw
1y ago
They are pitching co-located PV, and they already have a system to move the heat inside the pile of dirt!
33.
▲
by
Straw
1y ago
If you want heat, why bother converting sunlight to electricity first? You lose 80%. Is it that much more expensive to use mirrors to concentrate sunlight and capture near-100% of the energy as heat?
34.
▲
by
Straw
1y ago
If you don't include rent, real estate has significantly underperformed equities as an investment: https://www.frbsf.org/wp-content/uploads/wp2017-25.pdf
35.
▲
by
Straw
1y ago
I broadly agree with you, but there is really a point here about land ownership. Although developments of the land do improve the value, and thus land ownership has significant utility economically by incentivizing this, there isn't re
36.
▲
by
Straw
1y ago
It's because going from 1 to 2 changes the expected worst case load from an asymptotic log to an asymptotic log log, and further increases just change a constant. See https://en.wikipedia.org/wiki/Balls_into_bins_p
37.
▲
by
Straw
1y ago
I think the parent meant that R6RS has `syntax-rules`, which has enough power to implement CL `defmacro` as well as `syntax-case`.
38.
▲
by
Straw
1y ago
If you criminalize hiding your mental illness, you can be sure that people will hide it! Even if the alternative has some money attached.
39.
▲
by
Straw
1y ago
I'd much rather have a mentally ill person with treatment flying the plane than without! You don't get to choose "no mental illness" because of the bad incentives of hiding them!
40.
▲
by
Straw
1y ago
Good catch, thank you!
41.
▲
by
Straw
1y ago
One can generalize this to k missing numbers the same way as we typically do for the addition case by using finite fields: XOR is equivalent to addition over the finite field F_2^m. So, in this field, we're calculating the sum. If we h
42.
▲
by
Straw
1y ago
sqrt(2), and pretty much everything else you can think if, is computable- there's a program that can output rational numbers arbitrarily close. BB(n) is not.
43.
▲
by
Straw
1y ago
It likely comes from the smallest machine that someone has been able to construct that can diagonalize over all proofs in ZFC, or something similar.
44.
▲
by
Straw
1y ago
To downvoters: I'm well aware that BB(748) is an integer definable in classical logic. My claim is that "integer definable in classical logic" does not actually correspond well to what people mean by "number" in alm
45.
▲
by
Straw
1y ago
Don't you want the weakest (ie makes the fewest assumptions) theory that works?
46.
▲
by
Straw
1y ago
Yes, I would say that neither is really a number in the traditional sense of the word, nor in constructive analysis.
47.
▲
by
Straw
1y ago
You say the busy beaver function is a function. But I can claim it's not, because you cannot make it constructively- in constructive analysis, all functions are computable. Many other numbers and functions are computable, including e,
48.
▲
by
Straw
1y ago
Sure, if someone just gives you the number, ZFC can represent it. But ZFC cannot prove that the value is correct, so how do you know you have the right number? Use a stronger proof system? Go a bit bigger and same issue.
49.
▲
by
Straw
1y ago
The category error is in thinking that BB(748) is in fact, a number. It's merely a mathematical concept.
50.
▲
by
Straw
1y ago
Yes, that's right, dividing by that ratio essentially barely affects the number in a sense that 'adjacent' numbers in that notation give a much bigger change. 10↑↑10,000,000 / (sand grains per universe) is vastly larger
51.
▲
by
Straw
1y ago
You can do all of these in terms of matmul to some extent: Solving AX=B can be done with Newton's method to invert A, which boils down to matmuls. Matrix exponential is normally done with matmuls- the scale down, Taylor/Pade and s
52.
▲
by
Straw
1y ago
AZ uses a known transition model. I wouldn't call this model-based, because when people say model-based they usually mean learning a world model. MuZero doesn't actually learn a state transition function- it only models reward. It
53.
▲
by
Straw
1y ago
Its simpler than that- if you always play what you believe is optimal, you will never explore strategies that may in fact perform better.
54.
▲
by
Straw
1y ago
This post mischaracterizes AlphaZero/MuZero. AlphaZero/MuZero are not model based, and aren't on policy either. They train at a significantly higher temperature, and thus intentional suboptimal play, than they use when playin
55.
▲
by
Straw
1y ago
You might find it interesting to know that in the mid 1800s, in the UK, during a 10-year period, private investment in railways totaled 40% of GDP- an average of 4% per year. For comparison, the Apollo program was <0.5% of GDP. The list
56.
▲
by
Straw
1y ago
I'm looking forward to seeing your results! Here are corresponding results for LCGs, interestingly there's a clear affine relationship between state size and log(bytes to practrand failure). https://www.pcg-random.org&#
57.
▲
by
Straw
1y ago
I'd be very interested to see a state-size capacity analysis in the style of PCG- if you make cut down versions of your generator with reduced state size, say by reducing the word size of all three words of state, how low can you go wh
58.
▲
by
Straw
1y ago
I understand that, my claim is that you'd get false negatives- people who aren't laptop farm users but don't know the color of their front door and aren't at home to check.
59.
▲
by
Straw
1y ago
Why does knowing your front door color have anything to do with hiring? You might just be someone who's very focused on things, so much so that you ignore the environment around you to focus!
60.
▲
by
Straw
1y ago
Lisp macros allow a general solution to this that doesn't just handle chained collection operators but allows you to decide the order in which you write any chain of calls. For example, we can write: (foo (bar (baz x))) as (-> x baz
More ›