Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Kranar
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
31.
▲
by
Kranar
1y ago
That's a misinterpretation of what the article says. There is no actual bound in principle to what can be computed. There is a fairly practical bound which is likely BB(10) for all intents and purposes, but in principle there is no fin
32.
▲
by
Kranar
1y ago
This is true in general for every mathematical proof in ZFC (and even in more powerful theories). The decision problem "Given a formula F and an integer n, is there a ZFC proof of F of length <= n?" is NP complete, meaning that
33.
▲
by
Kranar
1y ago
Plenty of companies have gone bankrupt or lost a great deal of credibility due to a single bug or single failure. I don't see why CrowdStrike would be any different in this regard. The number of bugs/failures is not a meaningful m
34.
▲
by
Kranar
1y ago
Being granted a patent does not make it enforceable. Prior art is a defense against patent litigation.
35.
▲
by
Kranar
1y ago
Clang modules are nothing like what got standardized. Clang modules are basically a cleaned up and standardized form of precompiled headers and they absolutely speed up builds, in fact that is primarily their function.
36.
▲
by
Kranar
1y ago
Visas can come with a bunch of rules attached to them about what you can or can't do in the host country, and those rules can get kind of tricky to properly interpret.
37.
▲
by
Kranar
1y ago
New virtual methods, yes.
38.
▲
by
Kranar
1y ago
It's not a problem here as it has nothing to do with this to begin with. I am pointing out a limitation in a feature that the author has presented, but that feature does not resolve anything about the topic being discussed. The goal is
39.
▲
by
Kranar
1y ago
Virtual methods and overloading are not the same thing. You are likely mixing up the term over load with the term over ride .
40.
▲
by
Kranar
1y ago
And what exactly do you think traits apply to types exactly? If your answer doesn't start with an "m" and end with a "ethod", then you may need to re-read the Rust book found here: https://doc.rust-lang.o
41.
▲
by
Kranar
1y ago
While this has nothing to do with the expression problem, it's worth noting that in any case your solution does not work in general. Rust does let you impl traits for types or traits that are inside of your crate, so your example stric
42.
▲
by
Kranar
1y ago
C++ lets you inherit from multiple classes as well. I don't see how this has anything to do with being able to add new methods to existing types.
43.
▲
by
Kranar
1y ago
Classes in C++ have methods too. The problem is that you can't add new methods to an existing class.
44.
▲
by
Kranar
1y ago
>I don't understand what problem the author is trying to solve here - maybe it's language specific? More related to dynamic typing and efficient dispatch? The expression problem only arises in statically typed programming langu
45.
▲
by
Kranar
1y ago
Nothing you mention is related to this article and neither Rust or C# solve the expression problem. The expression problem is about being able to extend both data types (new cases) and operations (new functions) without modifying existing
46.
▲
by
Kranar
1y ago
The committee very politely showed him the door.
47.
▲
by
Kranar
1y ago
>For example if you have a nested class that you want to use in an unordered_set in its parent class then you just can’t do it because you can’t put the std::hash specialization anywhere legal. This is not true. From within your parent c
48.
▲
by
Kranar
1y ago
There is a version of C++ that adds complete memory safety to the language by adding features to the language in a way that preserves complete backwards compatibility with existing C++ source code. That version of C++ is called Circle/
49.
▲
by
Kranar
1y ago
Safety profiles don't exist and there are so many issues with them that it's unlikely they will ever get added to the language. For example, you mention how it's a method applied to a source file, but C++ doesn't have th
50.
▲
by
Kranar
1y ago
Risks for both contact lenses and LASIK are incredibly low, but with that said strictly from a quantitative perspective, contact lenses carry a higher risk of permanent vision loss than LASIK. The issue is that the risk of LASIK is almost e
51.
▲
by
Kranar
1y ago
C++ compilers are not required to be deterministic and in practice are not, at least as far as "same source code produces same observable behavior". Things that can introduce non-determinism include the order in which symbols are
52.
▲
by
Kranar
1y ago
>Then why are they so deserted most of the time? What general age range are you? I ask because before COVID, The PATH in Toronto was absolutely packed and incredibly busy. Nowadays it's true that the PATH has far fewer pedestrians b
53.
▲
by
Kranar
1y ago
Concentrated wealth along with a lack of currency circulation results in deflation, not inflation: https://en.m.wikipedia.org/wiki/Velocity_of_money Pretty ironic that you'd call out economic chops when this is a
54.
▲
by
Kranar
1y ago
The presentation you are making is both incorrect and highly misleading. There are algorithms whose correctness depends on sequential consistency which can not be implemented in x86 without explicit barriers, for example Dekker's algor
55.
▲
by
Kranar
1y ago
The concept of sequential consistency only exists within the context of a programming language's memory model. It makes no sense to speak about the performance of sequentially consistent operations without respect to the semantics of a
56.
▲
by
Kranar
1y ago
It's a common misconception to reason about memory models strictly in terms of hardware. Sequential consistency is a property of a programming language's semantics and can not simply be inferred from hardware. It is possible for h
57.
▲
by
Kranar
1y ago
You need it to avoid a use after free.
58.
▲
by
Kranar
1y ago
Yes exactly, imagine a function HH(n) that returns 0 if the Turing machine represented by the integer n halts, and 1 if it doesn't. Then HH the function itself is not computable, but the numbers 0 and 1, which are the only two outputs
59.
▲
by
Kranar
1y ago
Yes BB(n) is always a natural number which is by definition finite.
60.
▲
by
Kranar
1y ago
What specifically doesn't sound right?
More ›