Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
thesz
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
21 ms
·
421.
▲
by
thesz
2y ago
VHDL There is a record constructor syntax in VHDL using attribute invocation syntax: RECORD_TYPE'(field1expr, ..., fieldNexpr). This means that if your record has a first field a subtype of a character type, you can get record construc
422.
▲
by
thesz
2y ago
[1] https://pmc.ncbi.nlm.nih.gov/articles/PMC1931610/ Sweetness is more rewarding for rats than cocaine. [1] [2] https://www.addictionhelp.com/sugar/withdrawal-symptoms/ In humans, sugar
423.
▲
by
thesz
2y ago
You are absolutely right. AI is used to generate new code, not to reduce its size through rewrite [1]. [1] https://www.folklore.org/Negative_2000_Lines_Of_Code.html The code is always a burden, a legacy. To support it, one
424.
▲
by
thesz
2y ago
Prolog was introduced into general public in 1972, 4 years after Hindley's algorithm that used unification and substitution. In any case, what was suggested is, frankly, a development of the (tailored up) type system. My experiece sugg
425.
▲
by
thesz
2y ago
> If you pool together agents in a way where deterministic code meets and and verifies fuzzy LLM output And there is one more support case for the Rule of Contemporary AI: "Every LLM is supported by an ad hoc, informally-specified,
426.
▲
by
thesz
2y ago
Most probably, something like 65432 is just one token.
427.
▲
by
thesz
2y ago
Have you tried Haskell? For example, it is possible to embed backtracking logic programming [1] into Haskell with not a big effort. [1] https://hackage.haskell.org/package/logict
428.
▲
by
thesz
2y ago
> Develop your own ad hoc run-time type and mode checking system. "Any sufficiently complicated List or Prolog program contains an ad hoc, informally-specified, bug-ridden, slow implementation of half of Haskell type inferen
429.
▲
by
thesz
2y ago
"Suppose Alice has hashgraph A and Bob hash hashgraph B. These hashgraphs may be slightly different at any given moment, but they will always be consistent. Consistent means that if A and B both contain event x, then they will both con
430.
▲
by
thesz
2y ago
Let me introduce to you Kaldi, a speech-to-text engine. I put the link right into models directory, to save you some time. https://github.com/kaldi-asr/kaldi/tree/master/egs There are a bunch of shell, P
431.
▲
by
thesz
2y ago
https://www.sqlite.org/queryplanner-ng.html SQLite's planner is anything but simple. It has a beam search over different plans, basically, it approximates full NP-hard solution search process using bounded space and ti
432.
▲
by
thesz
2y ago
Eurisco [1], if I remember correctly, was once used to perform placement-and-route task and was pretty good at it. [1] https://en.wikipedia.org/wiki/Eurisko What's more, Eurisco was then used in designing Traveler
433.
▲
by
thesz
2y ago
Propaganda works by repeating the same in different forms. Now it is easier to have different forms of the same, hence, more propaganda. Also, it is much easier to iinfluence whatever people write by influencing the tool they use to write.
434.
▲
by
thesz
2y ago
Have you seen Suvorov Crossing the Alps [1]? [1] https://ru.wikipedia.org/wiki/%D0%9F%D0%B5%D1%80%D0%B5%D1%85...
435.
▲
by
thesz
2y ago
I think that there is some supporting machinery that uses symbolic computation to guide neural model. That is why chain of thought cannot be restored in full. Given that LLMs use beam search (at the very least, top-k) and even context-free&
436.
▲
by
thesz
2y ago
Let's say a factory builds a mega puzzle from many images shredded to identically-shaped puzzle pieces so you can piece them together as you want or need. Some pieces from some images are omitted due to their closeness in image space o
437.
▲
by
thesz
2y ago
> If lang is not compatible with any of python versions, then the lang isn’t python. Python versions are not compatible between themselves, as python does not preserve backward compatibility, ergo python is not python.
438.
▲
by
thesz
2y ago
I think that contemporary models are trained for engagement, not for actual help. My experience is the same as yours, but I noticed that while LLMs circa two years ago tried to come up with the answer, current generation of LLMs tries to ma
439.
▲
by
thesz
2y ago
KAN's have O(N^(-4)) scaling law where N is the number of parameters. MLPs have O(N^(-1)) scaling or worse. For where you need MLP with a tens of billions of parameters you may need KAN with thousands.
440.
▲
by
thesz
2y ago
> the vast majority of time fixing problems in software development is spent on systematic bugs and issues, not on dealing with type errors. You can make "systematic bugs and issues" a type errors, then deal with them as type e
441.
▲
by
thesz
2y ago
If you sort UUIDs, there will be a lot of common prefixes. B-trees implicitly sort data so you can factor common prefix from all keys of B-tree page. But! UUIDs are random and B-tree will have increased fragmentation after a short while. I
442.
▲
by
thesz
2y ago
LLMs have hard time to reason about adjacent topics. I have a favorite question to a LLM that can be (and is ) learned from papers from 2010-2012 (well before advent of LLMs) and I am keeping asking it for two years now. LLMs are able to c
443.
▲
by
thesz
2y ago
> Still, at least to some extent, this could allow a larger model to achieve similar performance to a Strawberry enhanced GPT-4o by adding more parameters, without the impact on speed and compute cost. I see a contradiction here, do you?
444.
▲
by
thesz
2y ago
> Its main purpose is to produce synthetic data for Orion, their next big LLM https://arxiv.org/abs/2404.03502 "This is generally useful, but widespread reliance on recursive AI systems could lead to a
445.
▲
by
thesz
2y ago
Actually, I learned from HN about leangains [1] and hypertrophy-specific training [2]. [1] https://leangains.com/ - it is now mostly Patreon, but circa 2008 it was awesome. A lot of information. [2] https://web.a
446.
▲
by
thesz
2y ago
I believe that doing deadlifts can make you expelled from Planet Fitness. Am I right?
447.
▲
by
thesz
2y ago
Express your algorithms as queries over arrays and you can change representation of arrays keeping queries the same. Who said SQL and columnar/row storage models? ;) Something like LINQ can do the job as well.
448.
▲
by
thesz
2y ago
The "Go of functional languages" title should go to Haskell. The Haskell's STM and channels implemented in it allow for most (or all) of the Go "select" statement, but in a library, not language.
449.
▲
by
thesz
2y ago
Ask Tinkov [1] about revoking citizenship. [1] https://www.expatriationattorneys.com/tinkov-conceal-foreign...
450.
▲
by
thesz
2y ago
https://en.wikipedia.org/wiki/Operand_forwarding Add and subtract is too expensive to be multiplied. This thing referenced above effectively reduces pipeline length by one step and is quite useful in scoreboarding-base
More ›