Kranar

26 ms·

301.
by Kranar 3y ago
The technical answer to your question is yes, another axiomatic system can exist that is able to prove that Peano is inconsistent. However, assuming that ZF is consistent, then that other axiomatic system would have to be inconsistent.
302.
by Kranar 3y ago
>This necessarily means that there are multiple possible values; if there were only one value, that value would be logically implied by ZFC regardless of whether it was provable in ZFC. This is a false statement. The fact that BB(745) ca
303.
by Kranar 3y ago
There is no paradox and yes, BB(745) is a specific integer, so it's nothing more than a sequence of finite digits. The fact BB(745) can't be constructed using ZFC only means that there is at least one Turing machine among the set
304.
by Kranar 3y ago
You argued that there are people in their 30s who can just afford food and shelter and implied that they are not having kids due to their economic situation, whereas 20 years ago (so in 2003) they would have had kids, presumably because the
305.
by Kranar 3y ago
Countries that provide government funding for childcare don't just throw money at childcare programs, they also regulate the price of childcare as well.
306.
by Kranar 3y ago
This claim doesn't add up. The fertility rate actually increases the lower your income is, that is, the richer you are the less likely you are to have kids. The issue is not that kids are expensive, it's that once you reach a cert
307.
by Kranar 3y ago
Do I have links off the top of my head that directly address this, no unfortunately I do not. I do have links to different pieces that you can use to understand this, however. First is the notion of the consistency strength of a formal syst
308.
by Kranar 3y ago
You can certainly define some set theories using arithmetic but arithmetic as formalized by first-order Peano arithmetic can not define a set theory powerful enough to prove results about uncountable sets, such as large cardinal axioms or e
309.
by Kranar 3y ago
Not where I work. Where I work people are very well aware that referencing counting is a form of garbage collection. Any memory management abstraction that simulates an infinite amount of memory is a form of garbage collection, including a
310.
by Kranar 3y ago
We should be clear, GC was never a feature in C++. What these features do, which are being removed, is make it easier to implement a GC allocator in a standard conforming and portable fashion. Current GCs in C++, such as Boehm's GC, de
311.
by Kranar 3y ago
Depends what they meant. An expert in C++ likely meant that C++ does not guarantee any fixed width types. Whether they are provided depends on the implementation.
312.
by Kranar 3y ago
You likely know this, but keep in mind the kind of selection bias in taking feedback mostly from your own users. The number of times I've heard product designers claim that their users prefer some aspect of how their application alread
313.
by Kranar 3y ago
Maybe the issue is that we're being too discrete, thinking in terms of absolute predictability or absolute unpredictability. Ultimately a 50% prediction rate means that you are as unpredictable as is possible, the state of maximum entr
314.
by Kranar 3y ago
Do you really "hate" ballet though? Like let's be honest here.
315.
by Kranar 3y ago
So there is definitely a subtlety here, which is not that memorization is bad in and of itself, but that learning things by memorizing them is a very short term strategy for actual understanding. For example I use math on an almost daily ba
316.
by Kranar 3y ago
No it's not. Plenty of people don't like math and it has nothing to do with how the universe works. The way that math is taught to most people is absolutely atrocious, involving rote memorization, following rules for the sake of f
317.
by Kranar 3y ago
No because metaphysics is not the science of science.
318.
by Kranar 3y ago
The paper that OP linked to is indeed about hardware transactional memory, but STM is a variation of transactional memory that is implemented entirely in software.
319.
by Kranar 3y ago
That's a lot more involved. We're a quant firm that have servers colocated globally at various exchanges, so our data is distributed across a lot of systems. The main and original purpose of this storage system is to provide one c
320.
by Kranar 3y ago
Soap in very small amounts is nontoxic. In larger quantities soap will absolutely cause a great deal of discomfort, vomiting or even result in chemical burns in your digestive tract. Soap poisoning is absolutely something people get concern
321.
by Kranar 3y ago
I mean yes, technically soap will destroy viruses that are already in your body absolutely. It will also destroy many other cells and proteins in your body as well since soap is an indiscriminate killer. The end result is that both viruses
322.
by Kranar 3y ago
HN is a community of people, and communities do form a consensus on issues. Whether HN as a community has formed a consensus on this issue I don't know, but it's worth noting that different communities absolutely form opinions on
323.
by Kranar 3y ago
It's since grown over the past 10 years to about 2 PB of storage. I mentioned I use rsync for backups.
324.
by Kranar 3y ago
Yeah sure, my process to learn was literally I went down to a local computer store, I bought a cheap desktop computer and 6 cheap hard drives, an HBA, a RAID controller, a bunch of cables, went back to the office and installed Ubuntu Server
325.
by Kranar 3y ago
Let's just say I hope I am interpreting something incorrectly, because if 500k is the minimum price and you match it to the minimum configuration found here: https://oxide.computer/product/specifications Then yeah
326.
by Kranar 3y ago
It's not a silver bullet but PGO does subsume these hints. Consider what do you do if PGO conflicts with your static hints? My hypothesis is that in that case the static hint is most likely incorrect and contributing to slower code. So
327.
by Kranar 3y ago
A proof of existence is not the same as a construction, so the fact that we know that there exists a TM that computes BB(748) does not mean that we know which specific TM does it or how to construct such a TM.
328.
by Kranar 3y ago
Then there wouldn't be a circular dependency. If the parent is in a library and was written independently of the child, then the parent could not possibly import the child.
329.
by Kranar 3y ago
>That's what the spec says, but are there any computers around anymore where nullptr is not zero? Yeah that's absolutely fair. I actually can't think of a single platform, embedded or otherwise, old or new, where the null
330.
by Kranar 3y ago
It is categorically false that BB(748) is not computable. On the contrary any particular BB(n) can be computed by some Turing Machine even though there is no Turing Machine that can compute BB(n) for every n.

More ›