Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
thorel
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
1.
▲
Finding and fixing Ghostty's largest memory leak
(mitchellh.com)
632 points
by
thorel
8mo ago
|
138 comments
2.
▲
by
thorel
2y ago
> The theory of finite fields is based on the theory of prime numbers, because the finite fields are sets of residues modulo a prime number or modulo a power of a prime number. It is note quite correct that the finite field of order p^k
3.
▲
by
thorel
3y ago
Agreed, thanks for the clarifications. Another result worth mentioning, which also shows that you cannot hope to uniquely characterize a structure by "reasonable" axioms is the Löwenheim–Skolem theorem which predates Godel's
4.
▲
by
thorel
3y ago
This idea of giving "meaning" to a set of axioms is precisely captured by the notion of "interpretation" in logic [1]. The rough idea is to map the symbols of the formal language to some pre-existing objects. As you say,
5.
▲
by
thorel
3y ago
The article is a bit oversimplifying in summarizing the axiomatic crisis as being problem with sentences like “this statement is false“. This being said, your intuition is absolutely correct, the crux of the issue is with ‘this‘. What mathe
6.
▲
by
thorel
3y ago
Isn't this what is suggested below the second picture? > Really, it’s harder than this picture suggests, because many experiences are based on other students. If I want you as my project partner but you want to forget I exist, then
7.
▲
by
thorel
3y ago
I agree. The GP comment contains some inaccuracies: most of the spaces of functions considered in functional analysis do not have an inner product defined on them, but are still vector spaces. The existence of an inner product presupposes a
8.
▲
by
thorel
3y ago
The realization that functions can be treated as elements in an abstract vector space (with infinitely many dimensions) is a turning point in the history of mathematics that led to the emergence of the sub-field known as functional analysi
9.
▲
by
thorel
3y ago
Among many other things, SUB Göttingen maintains the Göttingen Center for Retrospective Digitization (GDZ) [1] which hosts a very impressive collection of digitized documents. It seems that the managerial changes that prompted the open lett
10.
▲
by
thorel
4y ago
Regarding stochastic gradient descent, I think there has been an increased understanding in recent years, that the randomness introduced by the random sampling/batching is not only helpful in reducing the computational cost (compared t
11.
▲
by
thorel
6y ago
I agree that "continuous" is a poor choice of word. Reading the article, it is clear that the author does not care about continuity in the mathematical sense of the term, but rather about allowing the design parameters to vary as
12.
▲
by
thorel
7y ago
Some people trace the first exposition of recursive production rules for grammars back to Pāṇini (around 5th century BCE) [1] [1] https://www.jstor.org/stable/23497283?seq=1
13.
▲
by
thorel
7y ago
There are a few inaccuracies here: using automatic differentiation basically makes computing the gradient of the objective function as efficient as computing the function itself. But the main goal of algorithms being used in machine learnin
14.
▲
by
thorel
8y ago
I am not sure I understand the criticism of RLS. It feels to me that the Language Server Protocol does allow for incremental parsing etc. In particular, the approach taken by rust-analyzer > Analyzer maintains a "database" of i
15.
▲
by
thorel
8y ago
This is an interesting point, but note that the scheme you are suggesting is "stateful" (you need to remember the last ciphertext to be able to generate the next one). The standard definition of an encryption scheme (and the one u
16.
▲
by
thorel
8y ago
This is correct: if both parties have some pre-agreed secret, then it is much easier to secretly communicate over any channel and the method you are describing works and is similar in spirit to standard steganographic methods. However, deri
17.
▲
by
thorel
8y ago
You are right: the scheme relies on a sequence of cyphertexts being independent (or at least, appearing to be independent to someone who doesn't know the decryption key). However, this property is automatically guaranteed if the govern
18.
▲
by
thorel
8y ago
Note that the described scheme relies on a key exchange protocol (such as Diffie-Hellman). Remember that a key exchange protocol allows two parties to agree on a shared key; the key will be secret even in the presence of a passive eavesdro
19.
▲
Go and SQLite: when database/sql chafes
(crawshaw.io)
2 points
by
thorel
8y ago
|
0 comments
20.
▲
by
thorel
9y ago
To be fair, the original paper does mention the problem of whitespaces (see Appendix B on page 21). It seems that the recommended solution is to use this fast space remover: https://github.com/lemire/despacer
21.
▲
by
thorel
9y ago
It is very refreshing to see a website dedicated to classical music! Have you considered integrating with last.fm? At the very least scrobbling the listen history would be nice, but more advanced integration could be interesting to: synchro
22.
▲
by
thorel
9y ago
Worth mentioning the Google Kythe project [0] which is designed around the idea of providing a graph of entities appearing in the code to build tools which work with code. I always thought that it would be good if the Google Kythe and the L
23.
▲
by
thorel
9y ago
I am not entirely sure this is what you are looking for, but Beets [0] is a really cool command-line music organiser which uses the MusicBrainz database. [0] http://beets.io/
24.
▲
by
thorel
11y ago
A PDF version of the above article: http://vision.unipv.it/IA1/ProgrammingaComputerforPlayingChe...
25.
▲
Why?
(alistapart.com)
4 points
by
thorel
11y ago
|
1 comments
26.
▲
by
thorel
14y ago
I like the idea of automatically keeping session files up to date, but I think this plugin could benefit from following the usual approach to session management : store all session files in the same directory, provide an easy way to see you