s-macke

8 ms·

61.
by s-macke 11mo ago
Not quite right. Try the following. echo * cd /proc echo * while read line; do echo $line; done < /proc/cpuinfo The last line should work and print the entire file, but it seems there's a bug.
62.
by s-macke 11mo ago
That’s fast. Buggy, but fast. I’m totally impressed! Especially because I researched the necessary steps to do the same thing 10 years ago based on [0]. The patches required for this hack touch LLVM, libc, Linux kernel, BusyBox, ... and tot
63.
by s-macke 11mo ago
I will give a lecture about Haskell next week and might use this website for demonstration.
64.
by s-macke 1y ago
Take oscar64 [0]. So far the best C compiler for the C64 with a lot of extra options, good library and a good documentation. [0] https://github.com/drmortalwombat/oscar64
65.
by s-macke 1y ago
Like this one? https://www.shadertoy.com/view/ltffzl
66.
by s-macke 1y ago
The answer is yes according to code and documentation [0]: > The stream multiplexing capabilities of QUIC allow reducing the head-of-line blocking that SSHv2 encounters when multiplexing several SSH channels over the same TCP connection
67.
by s-macke 1y ago
It is not faster in this sense. However, an SSH connection can have multiple substreams, especially for port forwarding. Over a single classical connection, this can lead to head-of-line blocking, where an issue in one stream slows everythi
68.
by s-macke 1y ago
Author here. The discussion about this wording is actually the opening section of the article. > Unfortunately, the term hallucination quickly stuck to this phenomenon — before any psychologist could object.
69.
by s-macke 1y ago
Like they learn facts by heart, they learn what they can’t by heart as well. Ask them to solve one of the Millennium Prize Problems. They’ll say they can’t do it, but that 'No' is just memorized. There’s nothing behind it.
70.
by s-macke 1y ago
Author here. You’ve just summarized the main part of the article. To keep things simple, the focus is on pure facts. But yes, the outcome of next token prediction is much more profound than wrong facts.
71.
by s-macke 1y ago
The Starflight role-playing game for DOS [0] was written in its own Forth dialect. Even today, it remains one of the games with the strongest Star Trek feeling. [0] https://en.wikipedia.org/wiki/Starflight
72.
by s-macke 1y ago
Yes, my comment came across a bit harsh, and it’s fine to pick up a few negative karma points. But I keep seeing Forth posts every two weeks where everyone has just built yet another interpreter. Actually I did a few projects with Forth and
73.
by s-macke 1y ago
Right. And once again, you’ll also notice that no one is actually coding anything useful in Forth.
74.
by s-macke 1y ago
Thanks. Fixed it.
75.
by s-macke 1y ago
Nice to see another developer who tried to implement Forth in Go (here’s mine: [0]). It’s not easy and usually takes several iterations. His implementation, while working for his use cases, is actually quite far from the originals. He uses
76.
by s-macke 1y ago
Author here. Yes, it runs a modern Linux from a 1.6MB binary. I did everything possible to make it as small as I could. It even compiles into WebAssembly and runs in the browser.
77.
by s-macke 1y ago
Livestream yesterday https://www.youtube.com/live/UDzGwTalVAc
78.
by s-macke 1y ago
LLMs can help you analyze the code, but not write it. Their ability to obfuscate is quite limited and uninspired. The last IOCCC was in 2020, so we've had plenty of time to work on it.
79.
Physics-Based Simulation Free Online Book(phys-sim-book.github.io)
3 points by s-macke 1y ago|0 comments
80.
Can diffusion models solve visual Sudoku?(github.com)
1 points by s-macke 1y ago|0 comments
81.
by s-macke 1y ago
Most of the sites I’ve seen are indeed just demos. I especially like Compute Toys [0], a Shadertoy clone for WebGPU. [1] is probably the best place to find demos. I have a site myself in which I experiment mainly with WebGPU Compute Shaders
82.
by s-macke 1y ago
That’s a good point. For 9:05, I expect it would work just as well, since the game helps the user in many ways. The puzzles are of the type “The door is closed”, and you solve them with “open door.” My suggestion concerns the poor performan
83.
by s-macke 1y ago
Try the game 9:05 by Adam Cadre [0]. It's one of the easiest (and best) non-trivial text adventures. Some models are able to reach the first or even second ending. [0] https://en.wikipedia.org/wiki/9:05
84.
by s-macke 1y ago
The answer to the paper's question is likely yes—especially if context is used effectively and memory and summaries are incorporated. In that case, chatbots can complete even more complex games, such as Pokémon role-playing games [0].
85.
by s-macke 1y ago
This paper only scratches the surface and feels incomplete, as it references only GPT-4 and mentions appendices that are not included. The examples are two years old. For a more in-depth analysis of chatbots playing text adventures, take a
86.
OpenAI Researcher Jason Wei: It's obvious that it will not be a "fast takeoff"(twitter.com)
36 points by s-macke 1y ago|16 comments
87.
by s-macke 1y ago
Maybe WebVM is something you are looking for [0]. [0] https://github.com/leaningtech/webvm
88.
by s-macke 1y ago
Thanks. This is awesome. For the emulator I wrote my own 200 line libc implementation with a five line malloc routine [0]. Nice to see another implementation, which does a little bit more. [0] https://github.com/s-macke&#x2F
89.
by s-macke 1y ago
clang can compile into wasm pretty well via the --target=wasm32 option. It creates small binaries. My 16-Bit x86 emulator with BIOS and DOS emulation is under 100kB [0]. [0] https://github.com/s-macke/FSHistory
90.
by s-macke 1y ago
My code uses some kind of very abstract byte code in a global heap []any structure (threaded code). "any" can be different types including Go functions. But most of them are pointers as usual in Forth.

More ›