aportnoy

Is Bel a smaller LISP than what's described in The Roots of Lisp? [1]

[1] https://paulgraham.com/rootsoflisp.html

aportnoy.com

For NVIDIA,

1. play around with the NVPTX LLVM backend and/or try compiling CUDA with Clang,

2. get familiar with the PTX ISA,

3. play around with ptxas + nvdisasm.

Well then… test your memory :)

Don't overclock your memory.

Wow I came back to post this exact reply. I set my system to a slightly high frequency, ran memtest overnight with errors.

Set it back down to a supported frequency, ran a full memtest suite again with no errors.

Never had any issues since.

> But the lack of ECC was a huge bummer at the time of purchasing my system.

Why?..

> extremely opinionated

I have not seen a single codebase that widely uses uint8_t and does not typedef it to u8. It is the exact opposite of "extremely opinionated".

Note Sam Altman is a Cerebras investor.

Asking because I am on that team :)

I went through the same hiring process and had a positive experience at every stage. I had a strong competing offer but went with the JAX team at NVIDIA.

I'll pass it along as feedback.

What happened?

1 is the multiplicative identity

0 is the additive identity

all([]) is True

any([]) is False

Go to the blog and skip to results: https://ai.meta.com/blog/seamless-m4t/

The project is a port of https://github.com/nviennot/core-to-core-latency from Rust to C.

I used to surf near Scripps Pier while in college and I remember there were always a couple people sitting outside in beach chairs working on their laptops.

Salk Institute is an even more surreal place.

The funny thing is Perl is now arguably more obsolete than sed and awk.

I recently interviewed with a fantastic startup in that space called TestFit (testfit.io).

This definitely isn't "printing" in the original sense, just a serialization algorithm.

In the original LISP with dynamic scoping I think it would be fair to serialize that expression as is: "just use whatever value is bound to 'y' at the time of evaluation, if any".

Everything is an object that is either a cons cell or an atom. Associate the address of each object with a unique index.

Serialize each object as a pair (index, obj), where 'index' maps back to the original address where the object was stored, and 'obj' is a pair of indices if the object is a cons cell, or the appropriate representation (string literal, integer, etc.) if the object is an atom.

Then to deserialize allocate a memory location for every index and load the objects as is. Then replace the indices with the corresponding (new) addresses.

Yeah, something like "a" in the below code wouldn't have a "natural" serialization I don't think:

  (define a (list "a"))
  (set-cdr! a a)

> In general lisps _can't_ print arbitrary objects in a form that can be read back in.

Hmm, why not?

I mean, his simulator already has a disassembler contained within it, would just need to replace comments with print statements.

How about a RISC-V disassembler in 200 lines of C99?

https://github.com/andportnoy/riscv-disassembler/blob/master...

APG flaring of the Vankor field? https://en.wikipedia.org/wiki/Vankor_Field

You might want to change the title to something not as clickbaity and misleading.

In Python, you can use sounddevice + scipy.fft + matplotlib to implement this functionality yourself.

What a weird article… The instruction count being about the same doesn’t make it the same program… Why isn’t he using -O3?

That’s because you are running it on hardware implementing IEEE 754 floating point.

Calculus, linear algebra, and C will be hot as fuck this year.