srcreigh

12 ms·

211.
by srcreigh 2y ago
Not really a problem in practice. Most clustered tables don’t have a single last page. For ex it’s common to order a table by (used_id,pk) so a users data is grouped together. Dropbox did this For the ones which do have a single last page,
212.
by srcreigh 2y ago
In Postgres every read happens in increments of 8kb If your rows are not ordered on disk, the amount of data you need to load to query 100 rows is insane 10kb query result (100 rows 100 bytes) requires almost 1mb of data to be loaded- it’s
213.
by srcreigh 2y ago
Nothing wrong with 128bits primary key. Postgres is a horrible DB that can’t order rows on disk, so it doesn’t matter if you use UUIDs or not, you’re SOL. In fact, you could use 512bits primary key with MySQL and still, range queries would
214.
by srcreigh 2y ago
Is 175 the average score, or 1 std dev more blue than average? We may never know.
215.
by srcreigh 2y ago
You should learn about some basic database internals. In particular the data structure for indexes, the difference between primary and secondary indexes, join algorithms, page size being 8KiB, etc. That knowledge gets you to a place to unde
216.
by srcreigh 2y ago
In your world, the incremental UI code lives in the react library, and react applications aren’t UI code, they’re just FRP data transformations.
217.
by srcreigh 2y ago
If I wanted to be a silly pedant, I’d say that Turing machines are language specifications and thus it’s theoretically impossible for an LLM or any program to validate output formats in general.
218.
by srcreigh 2y ago
> The tokens that are valid at the beginning of the output include things like {, {“, {\n, etc. However, once the model has already sampled {“val, then { is no longer a valid token Oops, this is incorrect. {“val{“:2} is valid json. (modu
219.
by srcreigh 2y ago
The “make search difficult to change” is more obviously anti trust worthy, and if they did make this deal I would not be surprised if they were careful to not write anything down. (Not to mention google deleting chats against court orders)
220.
by srcreigh 2y ago
Apple could be getting paid off by google to keep this aspect of search difficult to change.
221.
by srcreigh 2y ago
Is there any axiom for the principle that the laws of physics don't change with time? (not sure if that even makes sense-not a physicist)
222.
by srcreigh 2y ago
the product page seems to indicate it has built in PoE https://radxa.com/products/x/x4/
223.
by srcreigh 2y ago
Yep, thx.
224.
by srcreigh 2y ago
It’s more like 2NM where M is loading the data from disk/memory. One pass is 2N+M. Why go to the store and back twice to buy two things instead of buying two things in one trip? ;p
225.
by srcreigh 2y ago
Easy trick to making joins 50x faster: don't use Postgres and give your tables a primary key which groups related items together. A lot of people don’t know that a database index doesn’t order the actual rows on disk. It’s just a Btree
226.
by srcreigh 2y ago
This is incorrect.. the equation represents the number of elements in Nat based on its definition. Integers could be Int = Nat | Neg Nat. So Int = 2 * Nat. Your logic would presumably interpret this as even naturals.. but ya
227.
by srcreigh 2y ago
It’s a cliche mathematician debate. I don’t disagree. In any case, if you aren’t able to do proofs, you don’t do math.
228.
by srcreigh 2y ago
Yep.
229.
by srcreigh 2y ago
The core of math, as GP mentioned, is learning proofs. I would go as far as to say that most high school “math” and “math” taught in many college courses is borderline irrelevant. It’s like learning how to paint by memorizing names of color
230.
by srcreigh 2y ago
Apple Maps has crowdsourcing features
231.
by srcreigh 2y ago
Thanks for explaining this, it truly is fascinating. This appears to be an argument that almost every axiomatic theory isn't Σ₁-sound. So I can only ask a few things: 1. How do I even learn about Σ₁-soundness? I've tried for 30 mi
232.
by srcreigh 2y ago
Bit of a side note, but the article is a bit misleading here. Collatz-TM connections have been investigated much earlier. My fav is John Conway in 1972, who showed that the generalized Collatz problem is undecidable.[1] [1]: https:/&#
233.
by srcreigh 2y ago
You are right, sorry about that :-) Hope my comment addresses a common confusion despite its unnecessarily corrective tone.
234.
by srcreigh 2y ago
I don’t have the understanding, but apparently there are finitary statements which are independent of ZFC. This has been used to prove that BB(745) is independent of ZFC. https://mathoverflow.net/a/26605 Furthermore, S
235.
by srcreigh 2y ago
You are correct, thank you
236.
by srcreigh 2y ago
We must know the percentage which halt! I can’t find it in the bbchallenge.org site, but every machine is categorized.
237.
by srcreigh 2y ago
Edit:nvm see thread For collatz, the empty input machine loops over all natural numbers and halts if it finds one which doesn’t eventually reach 1. To prove that it never halts, you’d have to prove the collatz conjecture. Otherwise you’d ha
238.
by srcreigh 2y ago
BB(745) being independent of ZFC isn’t due to incompleteness theorems. It encodes a different theorem which is also independent of ZFC. https://scottaaronson.blog/?p=2725
239.
by srcreigh 2y ago
Thanks for typing all that out. It is very fascinating. I’m just not convinced that fixing a theory and disallowing soundness axioms is any practical impairment for discovering busy beaver numbers. Of course things get out of hand, but then
240.
by srcreigh 2y ago
> Thus, you end up with an infinite regression, and you can't ultimately prove the consistency of any of these theories. There is similar issue with even ZFC and PA. It’s not really a dealbreaker imo. > Suppose that the longest-r

More ›