nyrikki

51 ms·

721.
by nyrikki 3y ago
Double entry accounting is the original immutable event architecture. They call out that it is hard to learn, but most of that in my experience is because people don't realize that credit cards and debit cards. Just remember the formul
722.
by nyrikki 3y ago
My big problem with 'Know why not (just) what' is that, as demonstrated in the responses here, the interviewers typically don't, and if you try it will sometimes result in them failing you. At a Google interview I tried to ex
723.
by nyrikki 3y ago
Even in Uncle Bob's version of the single responsibility principle, 'one reason to change' is about people. He words it poorly, but it is more about not commingling DBA, UX, core domain logic in a module. People miss that and
724.
by nyrikki 3y ago
DDD, Microservices, Clean, Hex, Onion, TDD, XP, EDA..... All of those follow the basic SOLID principals. The problem is the cargo culting and blog posts vs actually reading what the stuff means. S or the Single responsibility principal as a
725.
by nyrikki 3y ago
It tightly couples domain needs with implementation details. Thinking of it as a leaky abstraction helps me. I try hard to separate domain logic tests from implementation specific tests. Your code could be loosely coupled with high cohesion
726.
by nyrikki 3y ago
That is a common misconception about TDD. TDD is _about_ writing tests that matter, but most people think it is about writing all unit tests first. If you are following TDD anywhere close to the way it is described, you will only be writing
727.
by nyrikki 3y ago
No, just a programmer that has to apply math. Transformers can only do what is called weak negation. if (not (goal X)), then (assert not x) One example I have seen is: "you can cross if you have no information on a train coming” VS: &q
728.
by nyrikki 3y ago
In this case, A* is in a finite, bounded 30 30 grid. As A is just a type of branch and bound algorithm, which the degenerate form is exhaustive search. Which should be able to 'prove' the absence of a path by simply failing to
729.
by nyrikki 3y ago
I have a hunch they made their decision to train off that particular type of A* traces to avoid an exponential number of embeddings.
730.
by nyrikki 3y ago
Data brokers and companies who own data brokers (Oracle) collectively spend about the same amount on lobbying as Google or Facebook did. They know raising a stink about that data after roe v wade was overturned would draw way too much atten
731.
by nyrikki 3y ago
For those of you who didn't get the joke here. (S)ETH is a bit of a bummer if you only consider the dominate term in big-O, for the general case. https://web.stanford.edu/class/cs354/scribe/lecture17.pdf
732.
by nyrikki 3y ago
Approximating exhaustive search is not logic or causality.
733.
by nyrikki 3y ago
The known lower bound for self attention is n^(2-epislon) PH, or the polynomial hierarchy is the collapse I was talking about, but note I was talking about global and not individual or families of instances. Schaefer's Dichotomy Theor
734.
by nyrikki 3y ago
My hunch is it will be horses for courses.
735.
by nyrikki 3y ago
You don't typically get to the Sigma_2^P level unless are a sadist or forced. Attention works differently in RNNs, and it may be able to find different tractable forms, and may solve different problems, but increasing generalization is
736.
by nyrikki 3y ago
Most of those have had practical deciders functions. If you consider NP-complete as the intersection of NP, which is a decision problem, and NP-hard which a decider function isn't possible; look at the success of heuristics between tho
737.
by nyrikki 3y ago
The Singleton case is NP-complete If you consider NP second-order existential logic, meaning that given x, you will get a y, While there may be many true values that aren't y, it will help Attention, which requires feed forward network
738.
by nyrikki 3y ago
In the general case that would be the same as hierarchy collapse of PH, which would prove P=NP
739.
by nyrikki 3y ago
Link to more pnas text, as usual it doesn't match the times copy very closely. https://www.pnas.org/doi/10.1073/pnas.2319696121
740.
by nyrikki 3y ago
Where you using cloud scale style purchasing in house or were you on enterprise servers with enterprise switches with enterprise storage? The cloud is good for many users, especially if they migrate to cloud native system design, but as a t
741.
by nyrikki 3y ago
IMHO per socket was extractive most of the time, especially when memory capacity was the limit on performance. The 'Oracle doesn't have customers, it has hostages' The main purpose shifted from a hypothetical development cost
742.
by nyrikki 3y ago
Real question, do you really want to know where you may be mistaken, or will you hand wave away information in order to protect what you believe? No judgement here but I am just tired of sharing information with people to explain why while
743.
by nyrikki 3y ago
"Between 75 percent and 80 percent of children with ADHD will see improved symptoms with the use of stimulants such as Adderall." So yes.
744.
by nyrikki 3y ago
IBM partially has a hold on banking because they have supported decimal floating point. By switching binary floating-point from radix 2 to radix 10 (decimal exponents) they get rid of some of the problems. IEEE has had these Decimal types
745.
by nyrikki 3y ago
Not exactly, Newton's fractal, which is topological, specifically the wada property, is a boundary condition. It relates to fractal (non-integer) dimensions, which was first described by Mandelbrot in a paper about self similarity. Her
746.
by nyrikki 3y ago
Yes, that was one of the big reasons to move to C++11 where I was at the time.
747.
by nyrikki 3y ago
C++ 'sets' are ordered mutable binary search trees in most implementations. Not the ties and hashtables of other languages. With strict weak ordering, you really only have the ordering of to elements. Ada took care of that polysem
748.
by nyrikki 3y ago
That is the entire basically the entire concept of complexity theory. The reals are compressed into the computable reals. The real numbers are un-computable 'almost everywhere' Semi-decidabity is just recursively enumerable that g
749.
by nyrikki 3y ago
Mutable global variables online work for linear code with no concurancy. Having code be tree like or at least a DAG is how you resolve what is probably most easily visualized as dependency hell. This is why many modern patterns try and stee
750.
by nyrikki 3y ago
Nope, one shell for all.

More ›