asrp

7 ms·

1.
Visualization of the OpenAI Proof of the Cycle Double Cover Conjecture(blog.asrpo.com)
1 points by asrp 3mo ago|1 comments
2.
by asrp 3mo ago
I put together some visualization and examples of the proof. The discussion here [1] was sometimes confused about the content. [1] https://news.ycombinator.com/item?id=48863490
3.
Visualization of the OpenAI Proof of the Cycle Double Cover Conjecture(blog.asrpo.com)
3 points by asrp 3mo ago|1 comments
4.
by asrp 3mo ago
I put together some visualization and examples of the proof. The discussion here [1] was sometimes confused about the content. [1] https://news.ycombinator.com/item?id=48863490
5.
by asrp 3mo ago
No, that's not a problem at all. It just the notation that's a bit weird. For example, if e is the a-edge (first edge) from the u side and v is the b-edge (second edge) from the v side then g_{u,e} = 0, g_{v,e} = a so d_e = 0 + f(
6.
by asrp 2y ago
Very nice work and cool project. However, the example in "3. Baremetal Cognition" is explained in an overly convoluted way, with many choices that IMO detracts from the point that (I think) you're trying to make. There's
7.
by asrp 4y ago
After each outer loop iteration, A[:i] (the array up to i) is in ascending order with the max of A at A[i]. This is true the first iteration since max(A) is eventually swapped to A[1]. This is true in subsequent iterations since during the
8.
by asrp 6y ago
I've put up a barebones Slack [1] and editable Wiki [2]. I might fill that with info I have in the coming weeks since I realized all I had were scattered files. Diving into this a bit, I remembered that fonc had it's own (now defu
9.
by asrp 6y ago
The language is high-level but I wouldn't necessarily say very high level. But because I'm trying to spin up language features at runtime (like a lot of Forth does), there are a few layers on top of the language primitives. I wish
10.
by asrp 6y ago
Thanks, a lot of this is new and useful to me. > Recently I've been wondering if there's enough interest for a Discord server or something. (In the spirit of STEPS, it'd be ideal to make a new collaborative thing that&#x27
11.
by asrp 6y ago
Is there some place STEPS fans can gather and gather our notes? There are archives of the FONC mailing list here [1]. I'm an outsider and also never got Frank to work. I was waiting for the Nile/Gezira thesis to get a high level (
12.
by asrp 6y ago
I've read through more of you post can came across the bottom comment (don't know how to permalink to it) which better expresses my comment above. > An optimizing linter has the problem of being destructive. It goes like this:
13.
by asrp 6y ago
> I've actually never considered putting the comment first! I'll have to think about that one. I'm sure there are many competing constraints so definitely don't do it because I'm suggesting this on a whim. :) My
14.
by asrp 6y ago
Sorry if I've asked these years ago and just don't remember the answer. > The '/copy-to-ebx' after the slashes is just my way of helping the reader understand what the instruction does. I don't want the read
15.
by asrp 6y ago
If you want to read this, I'd suggest looking at the sources in bootstrap sequence from the readme (boot.flpc, stage0.flpc, ...). Alongside, run some of the precompiled entries by hand by pasting it into the interpreter. Call `ps` once
16.
by asrp 6y ago
It is actually not hard to read (at least in the sense of knowing what something will do when executed; getting the bigger picture takes more practice). The (base) syntax is just whitespace delimited tokens, each representing a function cal
17.
by asrp 6y ago
Here's what I was thinking when I wrote the "incorrect assumption" line. But I think many other interpretations are also valid. You can think of sum([x*x for x in range(10)]) as "desugaring" to sum(li
18.
by asrp 6y ago
Author here! Go ahead and ask if you have any questions about internals or otherwise. Or e-mail me if you think of your question much later (e-mail in profile). I'm surprised it made it here even during a Github outage.
19.
Roll your own GUI automation library(blog.asrpo.com)
3 points by asrp 7y ago|0 comments
20.
Roll your own GUI automation library(blog.asrpo.com)
2 points by asrp 7y ago|0 comments
21.
by asrp 8y ago
I found your game to be a great improvement over the course's UI. Well done!
22.
Show HN: Nand to CPU – A circuit description language and simulator(github.com)
2 points by asrp 8y ago|0 comments
23.
Show HN: Nand to CPU – A circuit description language and simulator(blog.asrpo.com)
2 points by asrp 8y ago|0 comments
24.
by asrp 8y ago
I'd be very interested in such a community if it existed. I'd go as far as creating/hosting/maintaining such a place if needed.
25.
by asrp 8y ago
I don't have that much to add to the other replies here. I used to never use pdb in Python for many years (not knowing or forgotten it exists) and doing perfectly well. Then I started using post-mortem debugging and finding/fixing
26.
Making a low level Linux debugger, part 3: our first program(blog.asrpo.com)
171 points by asrp 8y ago|27 comments
27.
by asrp 8y ago
Thanks. The choice of gcc was somewhat arbitrary so clang could work too. I actually fiddle a bit with lldb before this. From your description, it sounds like I'd really ought to removing optimizations (with -O0 from what's sugges
28.
by asrp 8y ago
Thank you. I'll add an edit to the post later (here's hoping this[1] is accurate enough). I do not know the conventions well and this debugger/editor in parts help me see what's going on. In general, is there some "
29.
by asrp 8y ago
Thanks to both you and christophergray. The broken link should be fixed now.
30.
Making a low level Linux debugger, part 2: C(blog.asrpo.com)
102 points by asrp 8y ago|11 comments

More ›