Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
djacobs7
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
1.
▲
Show HN: Public Domain Video Search
(seeksequence.com)
2 points
by
djacobs7
2y ago
|
0 comments
2.
▲
Ask HN: How does programming affect your emotional state?
15 points
by
djacobs7
2y ago
|
13 comments
3.
▲
Public Domain Video Search
(seeksequence.com)
1 points
by
djacobs7
2y ago
|
0 comments
4.
▲
Talk with Other Hackers
(sixoclock.live)
4 points
by
djacobs7
2y ago
|
1 comments
5.
▲
by
djacobs7
2y ago
I built this website because I love meeting new people, because I work from home, and I was tired of sitting on big Zoom calls where I couldn't get to know anybody. Here, events are audio only, so they don't feel like a zoom meet
6.
▲
Show HN: Mixermixer – talk to other Hacker News users
(mixermixer.us)
2 points
by
djacobs7
3y ago
|
0 comments
7.
▲
Write your way with Langchain Self-Critique chains
(danieljacobs.blog)
2 points
by
djacobs7
4y ago
|
0 comments
8.
▲
by
djacobs7
6y ago
Is the article saying that the M1 is slower than we would have expected in this case? My understanding, based on the article, is that a normal processor, we would have expected arr[idx] + arr[idx+1] and arr[idx] to take the same a
9.
▲
by
djacobs7
6y ago
This is a little R package I wrote for doing spaced repetition in R: https://www.dontyouremember.com/
10.
▲
by
djacobs7
6y ago
It's crazy how similar pop music sounds from all over the world. The language differs, but the energy of the music is similar in a lot of different countries. I wonder if this is because everyone is using digital audio workstations li
11.
▲
Top 50 Packages for R's Tidy Tuesday
(dontyouremember.com)
3 points
by
djacobs7
7y ago
|
0 comments
12.
▲
Learn R with Spaced Repetition
(dontyouremember.com)
3 points
by
djacobs7
7y ago
|
0 comments
13.
▲
by
djacobs7
9y ago
Neat product. Looks like it needs a little polishing on the UI, otherwise looking forward to seeing what's coming next!
14.
▲
by
djacobs7
13y ago
Is it really true that you should compress before you encrypt? IT seems to me that the encrypted message should have the same amount of "information entropy" as the original message, so it should compress equally well.