nyrikki

47 ms·

571.
by nyrikki 2y ago
To remove the technology part. When Komatsu decided to go after Catapiliers market, the set quality as their first strategic intent. They then made sure that later strategic steps were beholden to that earlier one. XP/Agile manafesto
572.
by nyrikki 2y ago
No. Misremembering naming and product changes from over 30 years ago. Remember that OSF/1 was an attempt to win the UNIX wars. The later versions of ULTRIX had lots of BSD4.3 features that really made the move to ACP based systems feel
573.
by nyrikki 2y ago
> ...manually curate a high-quality (consistent) text corpus based on undisputed, well curated wikipedia articles and battle tested scientific literature. This assumption is based on the mistaken assumption that science is about objectiv
574.
by nyrikki 2y ago
The Entscheidungsproblem tends to rear its ugly problem Remember NP is equivalent to second order logic with existential quantified. E.g. for any X there exists a Y And that only gets you to truthy Trues, co-NP is another problem. ATP is h
575.
by nyrikki 2y ago
I ran over 1200 domains and the POP server for the largest ISP in a medium city on a single 3100, not on NT obviously, osf/1
576.
by nyrikki 2y ago
Kerr dropped a paper last winter that is interesting about the claims of Hawking etc.. https://arxiv.org/abs/2312.00841 > In conclusion, I have tried to show that whatever the Penrose and Hawking theorems prove has
577.
by nyrikki 2y ago
As nothing is unhackable, that is a false dicotomy. Why use passwords at all under that line of thinking. That is why we talk about reducing attack surfaces.
578.
by nyrikki 2y ago
Retention doesn't require it to be online. A tape sitting in Iron mountain would have a smaller attack surface and be compliant. Potentially this breach will allow litigation that was financially infeesable for some people. As a former
579.
by nyrikki 2y ago
Until the strong exponential hypothesis is (dis-)proven, the quadratic cost is required or you have to give something up. Just the cost of exhaustive search. As (dis-)proving SETH will resolve the P vs NP problem, I wouldn't hold my b
580.
by nyrikki 2y ago
ACID and DTCs will get you in legal trouble with financial systems. That is part of the reason financial systems backed by SQL are so complicated and fragile while old COBOL code keeps going. RDBMS tutorials always use ATMs as an example, b
581.
by nyrikki 2y ago
I am not talking about ease of programming, and c being imperative, and the explicit break are edge cases. But for case value value can only be char or int, and must be unique Really it is just sugar for if-else-if, but if you enforce expli
582.
by nyrikki 2y ago
Technically a huge switch statement isn't a ball of mud. It is mutually exclusive and completely exhaustive. It may have other issues, but is actually better than what this article is describing.
583.
by nyrikki 2y ago
So they rediscovered Stern-Brocot Trees in a less effective way. Dirichlet's theorem...Ford circles...etc
584.
by nyrikki 2y ago
Nit, decision problems are one type of computable problems, but you have other types like function problems, optimization problems, etc. NP, by definition involves decision problems, but many NP-Hard problems are optimization problems. More
585.
by nyrikki 2y ago
dendrocentric compartmentalization, spike timing, bandpass in the dendrites, spike retiming etc... aren't covered in the above. But it is probably important to define 'computable' Typically that means being able that can take
586.
by nyrikki 2y ago
Universal approximation just indicates existence of a suitable sequence, not that it is findable and doesn't apply with finite numbers of neurons. But MLPs are not good for everything. Where Simulated annealing works better than auto-d
587.
by nyrikki 2y ago
Ever have an LSMT quit writing a run half way through? Ever need to try and restore Cassandra where mutation storage order isn't guaranteed, with the last mutation always winning? It is absolutely not "atomic" if you have ev
588.
by nyrikki 2y ago
My guess is different extensions to Hindley–Milner type system, which is EXPTIME-complete in the worst case. HM isn't bidirectional in the special case, so probably the features they added vs the top level universal quantifier type tha
589.
by nyrikki 2y ago
> It proves, for instance, that certain types of graphs that have to do with groups, called Cayley graphs, must have Hamiltonian cycles Yes, graphs and groups.
590.
by nyrikki 2y ago
How did papers that demonstrated single layer neural networks can't do XOR, but multi layer neural networks can, hamper development? XOR is simply not linearly serperatable, requiring an MLP or kernel trick still holds. It is a similar
591.
by nyrikki 2y ago
Their is a very different scope at the OS level. Most of us know that the public Internet is based on surveillance capitalism, no matter if we hate it or are just complacent or ignorant. OS wide is far more problematic and of low value to t
592.
by nyrikki 2y ago
Human neurons are continuous input, with active dendrites and dendritic compartmentalization. Spikey artificial NNs seem to hit problems with riddled basins so far. A riddled basin is a set with no open subsets. Feed forward networks are e
593.
by nyrikki 2y ago
You test models where they fail in any field. The orbit of Mercury to discover GR as an example. As all models are wrong, but some are useful, finding where they fail is how you figure out if they are useful. As the 'AGI is near'
594.
by nyrikki 2y ago
They are talking about establishing a moon coordinate time. https://arxiv.org/abs/2402.11150 Cell sites synchronize time with the network, like you phone does but they are talking about Earth time.
595.
by nyrikki 2y ago
If you aren't leveraging the namespace abstraction of containers, why use them at all? Noting that I am being frank and honest here, but you don't have a dev problem here, but most likely an organization level problem. Namespaces
596.
by nyrikki 2y ago
You aren't thinking about the exponential decay of emissivity near absolute zero. It isn't linear like we get to assume to make the math easier. Thus why IBMs largest refrigerator can only dissipate tiny amounts when cold. > en
597.
by nyrikki 2y ago
Neither NP or NP∩coNP, are contained in BQP, for those that want a complexity theory version of the above. BQP: Bounded-Error Quantum Polynomial-Time, bounded by a max error of 1:3 BQP is the complexity class thought to contain problems wit
598.
by nyrikki 2y ago
Surface area is squared, volume is cubed, a larger object has to get hotter to expell the same amount of heat. Per unit of volume, your body produces more heat than the sun, exactly because it is an exponential function.
599.
by nyrikki 2y ago
> As a final remark, in this paper we only set up our general mathematical framework and leave a practical implementation for future work. Whitehead, Russell, and Gödel enter the room... Compact closed categories are forgetful functors.
600.
by nyrikki 2y ago
It is well known that it is impossible to eliminate hallucination in LLMs Here is a formal proof. https://arxiv.org/abs/2401.11817 Hopefully this article helps spread the word, but this is something that will have to b

More ›