Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
nyrikki
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
18 ms
·
211.
▲
by
nyrikki
1y ago
If you map LLM/LRMs to Norvig's Model based reflex agents, wouldn't this be expected behavior?
212.
▲
by
nyrikki
1y ago
I am pretty sure this is the paper. https://arxiv.org/abs/2503.01781
213.
▲
by
nyrikki
1y ago
Often, even outside of software, unit testing means testing a component's (unit‘s) external behavior. If you don't accept that concept I can see how TDD and testing in general would be challenging. I general it is most productive
214.
▲
by
nyrikki
1y ago
It isn't coupling low level implementation details, it is writing tests based on input and output of the unit under test. The expected output from a unit, given an input is not an implementation detail, unless you have some very differ
215.
▲
by
nyrikki
1y ago
The problem with TDD is that people assumed it was writing a specification, or directly tried to map it directly to post-hoc testing and metrics. TDD at its core is defining expected inputs and mapping those to expected outputs at the unit
216.
▲
by
nyrikki
1y ago
While i subscribe to the " principle of least power "; Rice's theorem extends to even total functions in finite time. So while you can make choices on what to over/under constrain, you are still stuck with “execute it a
217.
▲
by
nyrikki
1y ago
PO?O is just an object not bound by any restriction other than those forced by the Language.[0] From the typing lens, it may be useful to consider it from Rice's theorm, and an oversimplification that typing is converting a semantic
218.
▲
by
nyrikki
1y ago
Python is a good glue language, which helps with cleaning and interfacing with other languages that are more effective in specific contexts. The fact that it isn't dogmatic in it's opinions is a feature for the use case. It isn&#x
219.
▲
by
nyrikki
1y ago
LLMs are good at needle in the haystack problems, specifically when they have examples in the corpus. The counter point is how LLMs can't find a missing line in a poem when they are given the original. PAC learning is basically existen
220.
▲
by
nyrikki
1y ago
It could also be related to Rakotch contractions, which contains most non expansive pointwise mappings being a meager set. Thus sharing a base model would find some of the same fixed points.
221.
▲
by
nyrikki
1y ago
> Unfortunately, the C language has taken the "union" keyword from ALGOL 68, but instead of implementing proper disjoint union types, the C "union" has been made essentially identical with the FORTRAN EQUIVALENCE from
222.
▲
by
nyrikki
1y ago
> Finally, they introduce Invertible Bloom Filters, which add an exact get operation and a probabilistic listing operation. I haven't spent time digging into the implementation details, but the exact get should allow for verificatio
223.
▲
by
nyrikki
1y ago
Subbarao Kambhampati and his team has several papers strongly suggesting that the intermediate tokens are of no symantic import.[0] My hunch is that training explicitly for human acceptance of the intermediate/scratch tokens will end u
224.
▲
by
nyrikki
1y ago
It's all tradeoffs, with MySQL multi-master and multi-source models having their own issues and pg also has other options with their own tradoffs. ACID+distributed== tradoffs that will always keep this a horses for courses problem.
225.
▲
by
nyrikki
1y ago
All models are wrong, some are useful. Layer 4 to 7 is useful in this case, as layer 4 involves forging tcp/udp packets, which is vastly different than say a http level reverse proxy.
226.
▲
by
nyrikki
1y ago
Envoy calls it Layer 4 https://blog.envoyproxy.io/introduction-to-modern-network-lo...
227.
▲
by
nyrikki
1y ago
> Note: For simplicity, we’ll focus on Layer 7 (HTTP) reverse proxy. Layer 4 proxies are a very specific sometimes food that most people should actively avoid until they need it because of the tradeoffs. DSR is layer 4, and not in scop
228.
▲
by
nyrikki
1y ago
I haven't done a real review yet, but skimming it seems to relate to Arthur-Merlin[0] oracles and public fair coins. If you view random numbers as normal numbers, they will seem to be algorithmically random, or at least exceed the com
229.
▲
by
nyrikki
1y ago
That 1988 paper was a modification of the previous design,as an attempt to address criticisms, but thank you for the cite. It is important to realize that relations are abstract data structures that we treat like sets, not objects we constr
230.
▲
by
nyrikki
1y ago
The one place that I think the previous discussion lost something important, at least to me with functions. The popular lens is the porcupine concept when infinite dimensions for functions is often more effective when thought of as around 8
231.
▲
by
nyrikki
1y ago
From [0] which is Codd justifying it explicitly. > The term relation is used here in its accepted mathematical sense. Given sets S_1, S_2, ..., S_n (not necessarily distinct), R is a relation on these n sets if it is a set of ntuples ea
232.
▲
by
nyrikki
1y ago
No, you are confusing convention and simplifications for convenience for fundamental properties.. What is generally considered Standard set theory today is typically ZF(C) , which can be viewed and was intentionally developed as what is
233.
▲
by
nyrikki
1y ago
One is disappearing citizens for political speech or the crime of being born to active duty parents, who happened to be stationed over seas. Anyone in the US should be very concerned, no matter if it is the current administration's tho
234.
▲
by
nyrikki
1y ago
Can you provide any specific situation where the following does not hold? Especially if I add the constraint that rows have to be unique? Relations=Tables Rows=Tuples Columns=Attributes I think we may be from different schools of set theory
235.
▲
by
nyrikki
1y ago
In first order predicate logic with an n-ary relation, attributes are columns and tuples are rows aka a table and what Codd used to justify it. The typical normalization let's say in a star schema is viewable as a least fixed point. FO
236.
▲
by
nyrikki
1y ago
The 'relation' in the relational model is the tables, specific named columns and tuples, with specific abstracts [0] The relation is the table, normalization, foreign keys, candidate keys etc are all extensions to that base model
237.
▲
by
nyrikki
1y ago
IMHO the ORM was an unfortunate choice for trying to develop a generalization about abstractions. SQL's declarative model has an impedance mismatch with imperative programming, ORMs attempt to deal with that mismatch. SQL hides complex
238.
▲
by
nyrikki
1y ago
Any discussion about AGI requires a written definition of the term to have a reasonable discussion. What we have now matches what many of the popular texts would call "Narrow AI", which is limited to specific tasks like speech rec
239.
▲
by
nyrikki
1y ago
Thanks for the link. It finally explained why I was getting hit up by recruiters for a job that was for a data broker looking to do what seemed like silly uses. Cloud API recommender systems must seem like a gift to that industry. Not my ar
240.
▲
by
nyrikki
1y ago
The whole "Home taping is killing music" was really "Industry sharks are killing music" in the era that DAT died anyway. It did have a Streisand effect though.
More ›