LegionMammal978

9 ms·

91.
by LegionMammal978 1y ago
The peak run lengths of evens/odds 'should' go to infinity, but these runs become a smaller and smaller component of the overall average, so that it is expected to approach the long-term 50% regardless. In other words, an unb
92.
by LegionMammal978 1y ago
This post is literally about an issue observed in vixie-cron (as included in some distro c. 2013), not about any systemd implementation.
93.
by LegionMammal978 1y ago
It's considered a parse error [0]: it basically says that a parser may reject the document entirely if it occurs, but if it accepts the document, then it must act as if a space is present. In practice, browsers want to ignore all p
94.
by LegionMammal978 1y ago
It looks like that project does link against the usual Windows DLLs, it just doesn't use a static or dynamic C runtime.
95.
by LegionMammal978 1y ago
> where bar is now responsible for deallocating N bytes of stack before it continues onwards. That doesn't really seem feasible in general? For a function with pointer parameters, the compiler would need to generate a new version fo
96.
by LegionMammal978 1y ago
To the extent that some champion machines have Collatz-like behavior, it's usually not by iterating a function with randomized scale factors until the value hits zero (like in the original Collatz iteration), but instead by iterating a
97.
by LegionMammal978 1y ago
If you want automatic implicit tail calls for literally everything, then you need a solution for { FooObject foo = FooObject(123); return foo.bar(); } ending up in a UAF when FooObject::bar() tries accessing the receiver &q
98.
by LegionMammal978 1y ago
I agree, some of the Linux people have a very broad notion of what counts as a derived work, but I haven't seen much in the way of actual case law to support the conclusion that "white box reverse engineering is generally illegal&
99.
by LegionMammal978 1y ago
Though at the limit, it would have to be at least O(sqrt( n )) thanks to the Bekenstein bound [0]. And of course, as mentioned in TFA, you can always do better if you can get away with local random access in parallel, rather than global ran
100.
by LegionMammal978 1y ago
What everyone forgets is that regexes as implemented in most programming languages are a strict superset of mathematical regular expressions. E.g., PCRE has "subroutine references" that can be used to match balanced brackets, and
101.
by LegionMammal978 1y ago
It would be nice if people had any better terminology than "an IQ of 300". IQ is a relative measure: it currently peaks at ~196, based solely on the current human population. Any 200+ scores you see in headlines are just numbers s
102.
by LegionMammal978 1y ago
It provides an unlimited license specifically for reading and writing spec-compliant files, which could conceivably open you up to issues if you have implementation errors or attempt to extend the spec.
103.
by LegionMammal978 1y ago
> By following this logic you should have predicted Moore’s law would halt every year for the last five decades. I hope you see why this is a flawed argument. You prove too much. I do think it's continually amazing that Moore's
104.
by LegionMammal978 1y ago
> The point is, why predict that the growth rate is going to slow exactly now? What evidence are you going to look at? Why predict that the (absolute) growth rate is going to keep accelerating past exactly now? Exponential growth always
105.
by LegionMammal978 1y ago
Many people seem to assert that "constant relative growth in capabilities/sales/whatever" is a totally reasonable (or even obvious or inevitable) prior assumption, and then point to "OMG relative growth produces an
106.
by LegionMammal978 1y ago
The 8.7e45 "restricted" number in that repo rules out certain patterns of pawn promotions. It looks like the 5.68e50 "general" number is the true upper bound, allowing any promotions possible.
107.
by LegionMammal978 1y ago
Thanks for that link! I was looking for that answer a few years ago, but I couldn't find anyone who had carried it out all the way through (with the cost of "switching control" fully accounted for), nor many people who were e
108.
by LegionMammal978 1y ago
I'd be skeptical of the performance of any getBits() implementation. With the traditional approach ((X >> A) & B), you'll have to redundantly bit-shift all the data above the field you're aiming for. The other optio
109.
by LegionMammal978 1y ago
The lack of control over the scale to switch between absolute and relative error seems like somewhat of a shortcoming: it only works when you have values in the rough vicinity of 1. In any case, what I usually want from an error metric is a
110.
by LegionMammal978 1y ago
> Is C really "pure noise" if you can get A back out of it? If you throw out B, then there's no possible way to get A out of C (short of blindly guessing what A is): that's one of the properties of a one-time pad. But
111.
by LegionMammal978 1y ago
It doesn't seem to have much in the way of validation, e.g., it will indiscriminately let you use either ']' or '}' to terminate an object or array. Also, it's more lenient than RFC or json.org JSON in allowing
112.
by LegionMammal978 1y ago
On my desktop system, most of my problems with swap come from dealing with the aftermath of an out-of-control process eating all my RAM. In this case, the offending program demands memory so quickly that everything from legitimate programs
113.
by LegionMammal978 1y ago
Yes, this is about inverting cubics x(t) = P(t), subject to the conditions x(0) = 0, x(1) = 1, x'(t) ≥ 0 for 0 ≤ t ≤ 1. For Newton's method vs. algebraic methods, I was mainly looking at the "Test results" section of TFA
114.
by LegionMammal978 1y ago
Newton's method isn't really so useful for cubics (outside of lucky initial guesses), given how simple the algebraic expressions are. Meanwhile, I wonder to what extent the reported improvement over Blender's cubic solver has
115.
by LegionMammal978 1y ago
When you upload a video to YouTube, you agree that you own the copyright or are otherwise able to grant YouTube a license to do whatever they want with it [0]: > If you choose to upload Content, you must not submit to the Service any Con
116.
by LegionMammal978 1y ago
It's all just anecdotes vs. anecdotes. The alleged "broader pattern" is not proven by one any more than it is disproven by the other. (For what it's worth, I do think there is a cultural pattern, especially in biblical m
117.
by LegionMammal978 1y ago
In principle, you could reduce the problem into running a few very costly programs, so that the proof is completely verified as soon as someone eats that cost. (Some 6-state machines are already looking like they'll take a galactic cos
118.
by LegionMammal978 1y ago
The compiled proof does take a few hours to finish verifying on a typical laptop. But obviously the many experiments and enumerations along the way took much more total processing power.
119.
by LegionMammal978 1y ago
In this context, two syntactically-different TMs are considered "essentially the same" if all reachable states are the same up to reordering their labels (except for the fixed starting label A) and globally swapping the L/R d
120.
by LegionMammal978 1y ago
Its focus around constructible objects does lend itself well to the kind of proofs needed for non-halting. Usually they involve lemmas about the 'syntax' of a TM's configuration and how it evolves over time, and the actual nu

More ›