sean_pedersen

6 ms·

31.
The Math Behind Alien Signals [video](youtube.com)
2 points by sean_pedersen 2y ago|0 comments
32.
by sean_pedersen 2y ago
I am working on a visual search & exploration engine: https://digger.lol The goal is to create beautiful and useful maps of interesting data, empowering the user to explore more intuitively guided by semantic similarity. No
33.
Digital Uncertainty(seanpedersen.github.io)
2 points by sean_pedersen 2y ago|0 comments
34.
by sean_pedersen 2y ago
https://github.com/stanford-oval/WikiChat
35.
by sean_pedersen 2y ago
I thought import names and PyPI names are not always equal, thus this can not work reliably, right?
36.
Show HN: VibeShuffle – A smart shuffle CLI music player(github.com)
1 points by sean_pedersen 2y ago|0 comments
37.
by sean_pedersen 2y ago
I agree a loading indicator (spinner f.e.) is needed, I was confused when nothing happened. Also big yes on for a reset / delete feature.
38.
Exa.ai: Superknowledge(exa.ai)
1 points by sean_pedersen 2y ago|0 comments
39.
by sean_pedersen 2y ago
I agree in that a perfectly consistent dataset won't completely stop statistical language models from hallucinating but it will reduce it. I think it is established that data quality is more important than quantity. Bullshit in ->
40.
by sean_pedersen 2y ago
I wrote up this blog post in 30 mins, that's why it reads a little rough. I could not find explicit research on the impact of contradicting training data, only on the general need for high-quality training data. May be it is a pipe dre
41.
Overcoming the limits of current LLMs(seanpedersen.github.io)
119 points by sean_pedersen 2y ago|106 comments
42.
by sean_pedersen 2y ago
I like pixi ( https://pixi.sh/latest/ ). Let's me pin python version, install packages from conda and PyPI. And also written in Rust.
43.
by sean_pedersen 2y ago
This article screams LLM generated...
44.
Perplexica: Open-source Perplexity alternative(github.com)
378 points by sean_pedersen 2y ago|83 comments
45.
Surprises in Logic: Chaitin's incompleteness theorem(math.ucr.edu)
1 points by sean_pedersen 3y ago|0 comments
46.
Evolutionary (Organization) Development(ravn.substack.com)
1 points by sean_pedersen 4y ago|0 comments
47.
by sean_pedersen 4y ago
A lib generating 2D artifacts might benefit from showcasing these artifacts using image technology for the curious minds.
48.
by sean_pedersen 4y ago
The reverse is a "Quantum" tree (DAG): 4->1,4->8
49.
by sean_pedersen 4y ago
"That inverse doesn’t exist." That is my new math contribution apparently then. I am happy to explain my proof. I can inverse f(x)=f(x+1) easily as g(x)=f(x)-1 since g(f(x)) = x do you understand my functional inversion approach n
50.
by sean_pedersen 4y ago
You only criticized my first proof though. I shipped two proofs gladly! The second one just uses inverses of the collatz function and graph theory.
51.
by sean_pedersen 4y ago
Ah ok thanks for the corrections, so I need to evaluate how my 2D (projected) arithmentic works for the proof to work out. Thank you so much for taking my work seriously.
52.
by sean_pedersen 4y ago
I need an edorsment on arXiv to post it there in the math section... Can anyone help me? Here is my arXiv endorsment code: 9C8E9J
53.
I invented two proofs for the Collatz Conjecture(github.com)
2 points by sean_pedersen 4y ago|9 comments
54.
by sean_pedersen 4y ago
Who can find the mistakes?
55.
by sean_pedersen 4y ago
Published my proofs on my github for now, arXiv will follow. https://github.com/SeanPedersen/CollatzFunk
56.
by sean_pedersen 4y ago
Thx, will publish it there soon and post it here of course... can not post it there, need an endorsment for the math section. This is my endorsment code: 9C8E9J
57.
Help: I solved the Collatz Problem, what do I do now?
2 points by sean_pedersen 4y ago|3 comments
58.
by sean_pedersen 5y ago
Cool idea! Shouldn't this work also by concatenating the single document (you want to classify) with the compressed version of the conc. class corpus (saving compute time)?
59.
by sean_pedersen 5y ago
0.0?
60.
by sean_pedersen 5y ago
"once we find a first hit that produces X in less than 42 seconds we are done" yes this is what I tried to convey. Start with the shortest program e.g. print(""). Complexify it (span the tree of all valid programs), disc

More ›