Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
cepher
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
cepher
4y ago
I’ve been meaning to read Practical Common Lisp for some time. Would you recommend this even for complete beginners to Lisp?
2.
▲
by
cepher
5y ago
Kind of reminds me of the atemoya https://en.m.wikipedia.org/wiki/Atemoya . Saw it for the first time visiting South America, and it reminded me of a mix between a banana and something citrus. One of the best fruits I’v
3.
▲
by
cepher
5y ago
That sounds like an interesting curriculum. Would you mind sharing what program that was?
4.
▲
by
cepher
5y ago
I wonder what this means for the future of Brax [1]. 1. https://github.com/google/brax
5.
▲
by
cepher
5y ago
That class looks amazing. Took a higher level computer systems course in undergrad that roughly followed http://csapp.cs.cmu.edu/ (great course).
6.
▲
by
cepher
5y ago
I’ve recently gained an interest in computer architecture and systems programming in general after some high performance computing projects. Have been hearing about RISC-V from a distance, and am wondering if delving into it would be one of
7.
▲
Ludii, a general game system to play, evaluate and design a wide range of games
(ludii.games)
22 points
by
cepher
5y ago
|
2 comments
8.
▲
by
cepher
5y ago
I use linux+i3 at work, but personally have a mac. The main thing stopping me from ditching the mac is how convenient it is to swap files/photos between the iphone and mac, whether it’s through icloud or airdrop. Perhaps a nice solutio
9.
▲
by
cepher
5y ago
Does anyone know if this is more appropriate than the PlutoSDR for hobbyists? Seems like they have similar specs and are around the same price.
10.
▲
by
cepher
5y ago
This book was my introduction to OCaml, and I followed it concurrently with the Nand2Tetris course. Project 6 of Nand2Tetris [1] has you write an assembler for their hack computer, and OCaml seemed like a perfect fit. Chapter 10 of this boo
11.
▲
by
cepher
5y ago
Do you know if any tutorial exists for SNES emulators? Haven’t been able to find one, and I’ve heard it’s a large step up in difficulty from a NES emulator.
12.
▲
by
cepher
6y ago
I know that a parallel prefix algorithm [1] can be used to calculate fib(n), since we can use repeated matrix multiplications (a formulation appropriate for a prefix sum algorithm). The computation time can be O(n/p + log p), where p i