usgroup

12 ms·

151.
by usgroup 2y ago
Yes, this section of Wikipedia is spot on in my opinion: https://en.wikipedia.org/wiki/Occam's_razor#Controversial_as...
152.
by usgroup 2y ago
But we don't have an "outside-in" view? You have an inside + "guess the outside" view. Just because we can imagine an "outside-in" view, it doesn't mean we have it. If there is an "objective&quot
153.
by usgroup 2y ago
I think that "life is objectively meaningless" is an unfounded statement. You should start by proving that to be true. I also think it preferentially loads words like "objective" and "existence". It also doesn&
154.
by usgroup 2y ago
Nihilism strikes me as a very specific commitment. There is a difference between "there is no meaning", and "we don't know the meaning", or a myriad other recall/precision related questions such as "can we
155.
by usgroup 2y ago
> First, the contradiction thing. It's just.. An error/panic, why? Anyway, fine. I suspect due to the details of the proof. This condition looks likely to me for very small set cardinality making the algorithm inappropriate for
156.
Blocking, covariates and optimal experiment design(emiruz.com)
2 points by usgroup 2y ago|0 comments
157.
by usgroup 2y ago
From the abstract: "All the current state-of-the-art algorithms are, however, beyond the reach of an undergraduate textbook owing to their reliance on the usage of notions such as pairwise independence and universal hash functions. We
158.
by usgroup 2y ago
From the abstract: "All the current state-of-the-art algorithms are, however, beyond the reach of an undergraduate textbook owing to their reliance on the usage of notions such as pairwise independence and universal hash functions. We
159.
by usgroup 2y ago
From the abstract: "... All the current state-of-the-art algorithms are, however, beyond the reach of an undergraduate textbook owing to their reliance on the usage of notions such as pairwise independence and universal hash functions.
160.
by usgroup 2y ago
I found the paper took about as long to read as the blog post and is more informative: https://arxiv.org/pdf/2301.10191 It is about estimating the cardinality of a set of elements derived from a stream. The algorithm i
161.
by usgroup 2y ago
Yes, just like the algorithm that decides whether any given algorithm terminates could be "one algorithm" (if it was possible) :-)
162.
by usgroup 2y ago
In your statement, I'm not sure by which definition physically grounded things are a sufficient condition for being computable, but I think Penrose depends on the Turing notion of computability and the hardness of the halting problem.
163.
by usgroup 2y ago
I think -- roughly speaking -- Penrose argues that human capabilities such as transductive reasoning are clearly not computable, therefore falsifying the idea that the mind reduces to an algorithm. He then goes on to propose how nonetheless
164.
by usgroup 2y ago
Perhaps its where I live, or the people I know, but at my kids pre-school, I suspect that few 4 year olds could play naughts and crosses to a draw. I think that sort of awareness started around 5.5-6, where it became more normal. Gobblet Go
165.
by usgroup 2y ago
Doubtless there are some four year olds to whom some people could teach chess. However, I'd say that learning chess, beyond how the pieces move, was an extraordinary level of competence for a 4 year old.
166.
by usgroup 2y ago
I focus on just using stuff with my kids. Things like piloting a remote control car is hard for a 4 year old, but they still want to do it. Playing Tetris on a slow speed, naughts and crosses, simplified chess, making objects out of paper,
167.
by usgroup 2y ago
Truly. Immediately awash with nostalgia. Although I do feel its missing a spinning GIF, a visit counter and a visitors book :-)
168.
by usgroup 2y ago
Worth highlighting that make defines a DAG, and that you can run make tasks in parallel which will automatically bottleneck (as desired) on common dependencies, and fan out otherwise. The sort of massive C++ build that make can handle a
169.
by usgroup 2y ago
Shallow insight, but separating the algorithmic/representational and sqlite operational parts into own C projects, is possibly a good idea. I'd expect the rate of evolution to be significantly different between the two parts, and
170.
by usgroup 2y ago
A consequence of being an auto regressive model is not being able to plan token output. I think the author’s example is one of the many corollaries. You could prompt the LLM differently , for example to write a Python program that does the
171.
by usgroup 2y ago
Yes precisely. If I had a pound for each time a dev told me they wish they were a doctor, and another pound for each time a doctor told me they wish they were something else!
172.
by usgroup 2y ago
I've many regrets similar in vein to that of your friend. Over time I've decided that it's rather reductionist to think that things connect together so simplistically. The "how my life could have been better if X, ceteri
173.
by usgroup 2y ago
In some sense life is obviously path dependent, since everything you've done is at least dependent on what didn't happen to you. In another sense, there are many paths which lead to similar things, and path dependency can be Marko
174.
by usgroup 2y ago
For some people it is because retaining the good life depends on something tentative like staying competitive or relevant, or perhaps most tentatively of all: staying interested.
175.
Metric Learning with Linear Methods(emiruz.com)
1 points by usgroup 2y ago|0 comments
176.
by usgroup 2y ago
It’s an auto regressive model so it can’t do anything that requires planning tokens. It can’t do anything which implies a large or infinite token space (eg video understanding). It’s also limited to a reasonable response length since token
177.
by usgroup 2y ago
Id hazard a guess that live virus contact with people on scale is what — by chance — eventually selects a cross over strain. So virus that can be cultured into existence of out of milk presents a possible vector for that. Hence they are tes
178.
by usgroup 3y ago
Can I rephrase this? "Professional Go players finally have a software good enough to beat them, as a result of which they got better by using the software".
179.
by usgroup 3y ago
By way of reductio, I think one could make the same argument for the non uniqueness of the time domain and presumably anything else admitting to an isomorphism.
180.
by usgroup 3y ago
I do, sometimes. It comes with trying to optimise things. If you want to make "it" go fast or fit into RAM or whatever, at some point you may have to consider structure deeply. Take the "1 billion row challenge" as a goo

More ›