rocqua

58 ms·

871.
by rocqua 4y ago
Piecemeal deployment might work, if not discovered. But the discovery risk is rather large. When an opponent discovers the deployment, either after-the-fact, or during deployment. They have many responses beyond immediately launching everyt
872.
by rocqua 4y ago
Solar and batteries have some challenges about maintaining frequency and syncrhonization. When using spinning magnets (wind/steam turbines) the frequency is related to power draw. As demand spikes, the generators get slowed down. Effec
873.
by rocqua 4y ago
I dislike copyleft, but once you decided to go for copyleft, I think a clause like this makes a lot of sense. Copyleft licenses are inherently trying to coerce the world to be a certain way. A penalty clause like this is probably more effec
874.
by rocqua 4y ago
YouTube still needs to, legally speaking, accept DMCA claims from companies they have banned.
875.
by rocqua 4y ago
Isn't it great that they recognize this failure and are attempting to fix it?
876.
by rocqua 4y ago
My company uses a horrible SAP interface. I then had the complexity of making an Excel sheet that actually works, and making it properly interface with SAP so I only have to use the excel sheet.
877.
by rocqua 4y ago
The delta-v is not needed to get a big enough impact. The delta-v is needed to be able to maneuver into an intercept orbit. In case you don't know, for rockets the fundamental limit of their fuel is expressed in delta-v. Your kill vehi
878.
by rocqua 4y ago
The problem with weapons in space are that they put the opposing super-powers in an impossible position. Hence it forces them to make a move asap to prevent being at a total disadvantage. This is mostly because weapons in space can be used
879.
by rocqua 4y ago
That depends on whether that military thinks they rely on space less than the other military. But likely there will always be at least one military that thinks it would be to their advantage.
880.
by rocqua 4y ago
I would expect the bandwidth demands of the US military to be effectively infinite. Especially if the connection can be guaranteed and is low latency. Communication is incredibly valuable in maneuver based combined arms warfare. The main li
881.
by rocqua 4y ago
Generally, answering questions will raise new ones. It is very unlikely for a single paper to be the end of a line of research. Sometimes the new questions are quite fundamental (like here), sometimes the new questions are details, and some
882.
by rocqua 4y ago
It is less fun if the outcome is non-deterministic. It means that occasionally the win is determined randomly. That takes away a certain element of skill.
883.
by rocqua 4y ago
So you can start down a sequence that gives check-mate, but once it is the shortest sequence to check-mate, you have to abandon the check-mate.
884.
by rocqua 4y ago
Specifically with Ethereum, you can automate margin-calls and auto liquidation. This is the basis for a lot of DeFi, which recently was the blockchain topic du joure. The idea is that you can trade in options, or margin loans, with the smar
885.
by rocqua 4y ago
True, only executions of a program that exhibit undefined behavior are affected. But the moment it is clear a program will exhibit undefined behavior, the compiler is already allowed to do whatever it wants. So if 20 lines below an importan
886.
by rocqua 4y ago
I played around a bit in godbolt: https://godbolt.org/z/vWPWcGM1P It seems this is correct, but there are very quick cases where the compiler does not consider a program 'pure'. Even a simple call to 'pu
887.
by rocqua 4y ago
The program still contains undefined behavior. It is probably a matter of order of optimization whether the compiler catches the undefined behavior before it elides the useless statement. But it is certainly 'legal' for the compil
888.
by rocqua 4y ago
A quote from the C standard: "However, if any such execution contains an undefined operation, this International Standard places no requirement on the implementation executing that program with that input (not even with regard to opera
889.
by rocqua 4y ago
What about the following code: if (x > 4) { fflush(); int y = INT_MAX + 1; } Can the compiler not use that to assume that (x > 4) is false because otherwise it triggers undefined behavior? Hence it is allo
890.
by rocqua 4y ago
Food wraps make the food completely unedible, whilst an allergic person could avoid the straw but still consume the drink?? Best argument I could come up with.
891.
by rocqua 4y ago
Thanks for that lwn article. I had read it a long time ago, and had since forgotten the source. I've spent a few hours trying to find it in bug-trackers. really glad to have the link now, thanks!
892.
by rocqua 4y ago
I like that the compiler removes comparisons that always have the same result. It means I can write clear code, guard things rather than explain in a comment why the guard isn't needed, and know that the compiler will remove the ineffi
893.
by rocqua 4y ago
In short, your body affects the signal. And through MIMO there are multiple simultaneous signals being sent between different antennas on wifi-devices. With just one signal, wifi sensing doesn't tell you much. You sort-off have to look
894.
by rocqua 4y ago
For many pseudo-random generators, it is known what their period is. For most of those, it is known that they reach all possible states. For cryptographic quality random generators, I am not sure how much is known. In any case, the question
895.
by rocqua 4y ago
I understand you mean "deterministic finite-state machines" rather than "Turing machines". I meant "Turing machines with X states and a type limited to Y bits, with X + Y = N". You can, of course, cast those as
896.
by rocqua 4y ago
Turing machines do not have a true random(). In general the space of deterministic and probabilistic programs are very different. Now if you were to use a pseudo-random generator, and presume that this is the only function sampling from it,
897.
by rocqua 4y ago
It seems like we are effectively asking about the complexity of the halting problem of Turing machines with state space of N bits. It seems incredibly likely that this question has a complexity of O(exp(N)) which very quickly makes the halt
898.
by rocqua 4y ago
From wikipedia it looks like both the article's approximation and this method have octagonal level sets. I was wondering what the actual difference was. Looking into it a bit, I came across the error graph [2] from the article[1]. The
899.
by rocqua 4y ago
Decriminalize drug use, thorough social services support, start treating drug-users as patients with an illness rather than criminals with a moral-failing. This will probably require some decriminalization of drug sales. Just to get the dru
900.
by rocqua 4y ago
How come you are designing those systems single handedly? Might you be setting people against you at this early stage? That could be by outshining them, but more likely might be by ignoring their advice, and in general not including them? I

More ›