EDIT: And if you really think his power is absolute, then how is Kilmar Abrego Garcia still in the US?
29,848 karma · joined October 6, 2009
EDIT: And if you really think his power is absolute, then how is Kilmar Abrego Garcia still in the US?
Hypothesizing? He has failed to pardon people convicted in state courts already, because he doesn't have the power to do it. This isn't some untested hypothetical. He issued a pardon for Peters in Colorado and it didn't stand. Why? Because she was convicted in a state court.
Stop spewing nonsense.
I agree, that seems sufficiently clear.
Duck-typing can be implemented with static checks, and doesn't require inheritance to be involved at all.
> that it would allow ordinary mortals to write programs
So literally not the end of programming but increasing the number of people who could program.
And your other example is about databases specifically, not programming generally.
This is also not a math problem. It's a general STEM problem (I'm not even sure it's a problem, it's just a thing). The curricula is focused on solving problems and communicating the solution, but it is not focused on communicating the process of solving the problem. So why would they be good educators when they're not trained to communicate the process, but the solution, and education requires the former (among other thing)?
No, the title and article are about Starlink, Starshield isn't even mentioned.
Yes.
If you're foolish enough to give agents permission to act as you, then you're making a novice mistake. I guess this is a good chance to learn, but the right answer is to stop making novice mistakes and do things correctly. Not double down on the mistake by papering over it.
https://www2.eecs.berkeley.edu/Pubs/TechRpts/2020/Archive/EE...
In chapter 1 they provide an example of (using Erlang syntax, completely untested so probably needs some massaging to run as I'm rusty on Erlang) this scenario, which would be deterministic in Erlang:
counter() -> counter(1).
counter(N) ->
receive
dbl -> counter(N*2);
{inc, Arg} ->
N1 = N1 + Arg,
io:format("~w~n", [N1]),
counter(N1)
end.
main() ->
P = spawn(counter),
P ! dbl,
P ! {inc, 1}.
Because messages sent from one process to another are guaranteed to be made available in that same order, this is deterministic. They introduce a motivating example on page 5 (21 in the PDF) where a relay is introduced. relay() ->
receive
P -> P ! dbl
end,
relay(P).
main_with_relay() ->
P = spawn(counter),
R = spawn(relay),
R ! P, % <- trouble starts here
P ! {inc, 1}.
This may give the same result as the first example when run on the same node, but the guarantee is lost, it might not happen in the same order as the first version. For an example where it will likely give a different result, consider if counter were a local process to main (on the same node) while relay were a remote process (on a separate node) with high latency, it's likely that the network delay would result in {inc, 1} arriving before dbl.The work in LF lets you write this (don't ask me how, still reading) so that the relay would be logically instantaneous even if physically it wasn't, consequently the dbl message would arrive "first" by logical time and the counter would process things as in the original Erlang code.
Of course, you can make the Erlang relay behavior deterministic, but you have to add extra code to achieve it. LF apparently gives you a simpler way to get the desired determinism without having to write the extra code yourself, it's baked into its semantics.
The four attributes:
- Count: 3 in each; "all the same"
- Color: red, purple, green; "all different"
- Shape: diamonds, ovals, squiggles; "all different"
- Shading: empty, solid, striped; "all different"
So for each attribute the conditions are met, they are either all the same or all different.
What do you mean? The retirement planning with Monte-Carlo gave a better result than the base assumption of 4% returns and 2% inflation. The information MC provides let's you, when taking into account your risk threshold, whether you're satisfied with your savings or not by giving you more realistic odds of how long the money will last.
https://news.ycombinator.com/item?id=5318644 - March 4, 2013 (62 comments)
That's the opposite of what NDEBUG does. https://en.cppreference.com/cpp/error/assert
Critical bit:
> 1) If NDEBUG is defined as a macro name at the point in the source code where <cassert> or <assert.h> is included, the assertion is disabled: assert does nothing.
It also is impossible to guarantee it unless you're the only one compiling the program. If you've built a library that others can build and relied on asserts executing for your library to be correct, you wrote a bad library.
EDIT: Neither asserts nor these C++26 contract features should be used in a way that requires that they be executed. If you do, you're using them wrong because it is valid for someone to disable them as runtime checks. If the code must run, you should use some other mechanism, I'd recommend an if statement.
What makes you so certain it's inevitable?