GoblinSlayer

7 ms·

91.
by GoblinSlayer 2mo ago
Breakage is broken merger, which doesn't merge, i.e. results in distinguishable states. Correctly implemented merger must produce indistinguishable states. If the substrate tries to implement merger, but fails, then the substrate is br
92.
by GoblinSlayer 2mo ago
If the substrate is unreliable and breaks, then computation isn't implemented after breakage, the computation is still implemented before breakage. Do I understand it right that you claim that computer programs are nonportable if you a
93.
by GoblinSlayer 2mo ago
You hypothesize that a merger can fail when it's supposed to succeed? But the merger is a part of computation, so if it's required by computation, then it shouldn't fail, otherwise computation is not implemented. Indistinguis
94.
by GoblinSlayer 2mo ago
Instantaneous as in FTL?
95.
by GoblinSlayer 2mo ago
>Its design is not based on executing best algorithms, but rather finding good enough solutions among many time constrained but interlinked signal cascades. That's known as optimization algorithm, and genetic algorithm is known to p
96.
by GoblinSlayer 2mo ago
FWIW C++ can do bound checks aka hardened STL. On the other hand google did riir some of their programs and removed bound checks there for speed, welcome to real world, so absence of bound checks is not a mistake, but an intended performanc
97.
by GoblinSlayer 2mo ago
Can't you run servo apps in the browser? There's no compat in the reverse direction only.
98.
by GoblinSlayer 2mo ago
>and will be perpetually ignored in all discussions about cross-browser compatibility If violence doesn't solve your problems, you use not enough violence. Also if you don't implement web standards, it's doesn't mean
99.
by GoblinSlayer 2mo ago
Does Servo still launch a herd of processes like Electron?
100.
by GoblinSlayer 2mo ago
There are more important things to work on like that overengineered bloatware regex.
101.
by GoblinSlayer 2mo ago
Because webdevs are lazy and Electron works?
102.
by GoblinSlayer 3mo ago
Unix sockets kinda already connect by name.
103.
by GoblinSlayer 3mo ago
My algorithm is at least to not predict it as not what it is. All ten atoms decay according to the formula above.
104.
by GoblinSlayer 3mo ago
For this I made a tlv format, where string is encoded in byte prefixed chunks with length between 0 and 222 for final chunk and between 223 and 255 for intermediate chunks.
105.
by GoblinSlayer 3mo ago
I think C# switch supports type matching.
106.
by GoblinSlayer 3mo ago
We can predict decay process as sqrt(1-exp(-t/T))|1> + sqrt(exp(-t/T))|0>
107.
by GoblinSlayer 3mo ago
The trick is that you can't predict something that doesn't happen even if you feel otherwise.
108.
by GoblinSlayer 3mo ago
And health problems will pump money into big pharma.
109.
by GoblinSlayer 3mo ago
It's just names, might as well call it humpty dumpty time. Local time is defined by offset from UTC.
110.
by GoblinSlayer 3mo ago
Every division of society should just use its own schedule, then the number of divisions doesn't matter.
111.
by GoblinSlayer 3mo ago
That's what commoncrawl does.
112.
by GoblinSlayer 3mo ago
Since the decayed state exists, then any. Your question tries to assume sqrt(exp(-t/T))=0, which is false.
113.
by GoblinSlayer 3mo ago
> we do not need a complete, finalized theory of consciousness to assess AI sentience Erm... this can't possibly work, can it?
114.
by GoblinSlayer 3mo ago
The decayed state exists, it's the second term sqrt(exp(-t/T))|0>
115.
by GoblinSlayer 3mo ago
Observable effectiveness can be demonstrated statistically. The only option I see is if it's unobservably ineffective, which can't be ruled out experimentally.
116.
by GoblinSlayer 3mo ago
It works because humans looked for a method that works, they tried different methods and chose one that works best, actually it gradually evolved over time. Pure reason is conjecture with little empirical input (and big intuitive or memey i
117.
by GoblinSlayer 3mo ago
Deterministic processes can be modeled probabilistically and are computable, so existence of a probabilistic model doesn't say much about computability.
118.
by GoblinSlayer 3mo ago
The decay process is calculated as sqrt(1-exp(-t/T))|1> + sqrt(exp(-t/T))|0>
119.
by GoblinSlayer 3mo ago
Agnosticism is an example that nobody wants a theory that works but not empirically. If a theory works, then it must work empirically, in this sense empiricism is tautological.
120.
by GoblinSlayer 3mo ago
Isn't it obvious that scientific method is fallible? It's just statistically better than pure reason, which should be possible to demonstrate statistically. It's a product of trial and error, and there were many errors, I don

More ›