thesz

6 ms·

61.
by thesz 5mo ago
> As long as the tests pass and the performance doesn't regress... AMD had 20+ million tests for their FPUs back in the day of Intel's FDIV bug and ACL2 found bugs in their implementations of floating point computation.
62.
by thesz 5mo ago
The steepness of Haskell learning curve is exaggerated. I have experience where completely unmotivated (due to then ongoing very bad divorce) former Java programmer took a description of CPU for model code generation in Haskell's eDSL
63.
by thesz 5mo ago
I think you may find helpful this [1] almost 20 years old [2] agent. [1] https://github.com/augustss/djinn [2] http://lambda-the-ultimate.org/node/1178 The context window it requires for AI c
64.
by thesz 5mo ago
> LLMs have a temperature parameter. At zero temperature they are deterministic: they always choose the most likely next token at each step based on what came before and the model weights, and they will always generate the same outp
65.
by thesz 5mo ago
Have you tried to change your HDL to something more modern like Bluespec System Verilog or, god forbid, anything embedded into Haskell or Scala? I read that BSV source code is about three times shorter than similar design in Verilog and als
66.
by thesz 5mo ago
Alpha 21064, 1992, was using domino logic [1]. [1] https://en.wikipedia.org/wiki/Domino_logic There was no synthesis algorithms that would map VHDL or Verilog designs into domino logic elements at the time. I believe t
67.
by thesz 6mo ago
> But it’s not a clear cut that Haskell type system offers more safety guarantees. You can log operands in your implementation of Rust's Add trait, or compute running sum of one of the operands. In Haskell it is not possible
68.
by thesz 6mo ago
They used LTL as non-reduced binary decision diagrams (BDDs, binary trees in essence) to prove that transformers are exponentially more succinct that LTL. Should they allow reductions in LTL expressions, that exponential advantage of transf
69.
by thesz 6mo ago
Better food.
70.
by thesz 6mo ago
Haskell is the best imperative language [1]. [1] https://stackoverflow.com/questions/6622524/why-is-haskell-s... Haskell have array-oriented programming embedded DSLs, like REPA [2] and Accelerate [3]. [2] https:
71.
by thesz 6mo ago
> On the other hand, LLM-generated code comments better than I do, so given a long enough time horizon, it could be more understandable at a later time than code I've written myself (we've all had the experience of forgett
72.
by thesz 6mo ago
> LLMs make me significantly faster at writing code I was mediocre or bad at. But when I use it to write code in domains I have more knowledge in I see design and correctness problems all over the place and actively fix them and it
73.
by thesz 6mo ago
XML: 1996
74.
by thesz 6mo ago
Perturbation of dataset used for training can introduce adversarial behavior even without adding any other data, and idea is quite simple: you take two batches from the dataset for training and select model with more probable adversarial be
75.
by thesz 6mo ago
Thank you, these posts are very insightful! > The other, is that models have a blind spot, therefore creating a red team adversary bug hunter agent will not surface a bug if the same model originally wrote the code. This is very interest
76.
by thesz 6mo ago
BPE that is used in tokenization is very simple: https://en.wikipedia.org/wiki/Byte-pair_encoding
77.
by thesz 6mo ago
The page does very poor job tokenizing phrase "Noinceolik fiyulnabmed fyvaproldge" into "Noinceolik fiyulnabm ed fyvaproldge", factoring only "ed" suffix. As if made up words such as "noinceolik" are
78.
by thesz 6mo ago
Actually, the euphoric mood disorder may make one hear voices telling to feel great, do good, help all grandmas of the world through the crossing, etc. The "focus" and "get back to work" parts are hard, though.
79.
by thesz 6mo ago
To have some confidence in consistency of results (p-value), one has to start from cohort of around 30, if I remember correctly. This is 1.5 orders of magnitude increase of computing power needed to find (absence of) consistent changes of a
80.
by thesz 6mo ago
If I may (and correctly understand what is going inside Fil-C), it would be not so hard to add support for software transactional memory by adding some library calls. This will greatly reduce coordination bugs in parallel programs and may e
81.
by thesz 6mo ago
You took a simple path, embedding smaller into larger. What if you need to reduce number of layers and/or width of hidden layers? How will you embed larger into smaller? As for the "addition of same layers" - would the proces
82.
by thesz 6mo ago
Thanks, I didn't knew that. I thought that SLOC means "Source Lines Of Code."
83.
by thesz 6mo ago
That "underappreciated underlying structure or geometry" can be just an artifact of the same tokenization used with different models. Tokenization breaks up collocations and creates new ones that are not always present in the orig
84.
by thesz 6mo ago
Change layer size and you have to retrain. Change number of layers and you have to retrain. Change tokenization and you have to retrain.
85.
by thesz 6mo ago
Is it possible to get hacked through US Robotics Courier?..
86.
by thesz 6mo ago
I strongly believe you can use voice-to-text for coding. If the person I replied do use voice-to-text, their mention of carpal syndrome is moot and this is amusing. If they do not use voice-to-text, it is still amusing in the sense of my pr
87.
by thesz 6mo ago
Yes, I checked their history of comments before posting. It made me confident that I hit the right note. My software engineering experience longs almost 37 years now (December will be anniversary), six-to-seven years more than Earth's
88.
by thesz 6mo ago
From what I remember, typical new C++ debugged code speed is about 20-25K lines per year, lines that are non-blank, non-comment and not completely verifiable by compiler. E.g., standalone bracket or comma or semicolon are not lines of code,
89.
by thesz 6mo ago
> I think over-thinking is only solved by thinking more, not less. Despite "thinking" tokens being determined by the preceding tokens, they still are taken from some probability distribution, just a complex one. This me
90.
by thesz 6mo ago
It is important to question "how to judge," not "who is to judge." My answer of "how to judge?" question is the question "how easy is it to implement new unforeseen functionality with the code under scruti

More ›