LightMachine

9 ms·

91.
by LightMachine 2y ago
yes!
92.
Bend: a high-level language that runs on GPUs (via HVM2)(github.com)
1041 points by LightMachine 2y ago|253 comments
93.
by LightMachine 2y ago
Great question! Short answer: GPU Long answer: CUDA Seriously though. Implementing a full high-level lang in parallel is HARD, so, to simplify it greatly, we made IC nodes 64-bit, which allows us to use native 64-bit atomic operations in ma
94.
by LightMachine 2y ago
Yes, Kind2 will be a type layer on top of Bend, with a similar relationship as in JavaScript / TypeScript (but much more integrated, less ad-hoc and with proofs!). I don't want Kind2 to compete directly with Lean though, as it is
95.
by LightMachine 2y ago
It is an interpreter that runs on GPUs, and a compiler to native C and CUDA. We don't target SPIR-V directly, but aim to. Sadly, while the C compiler results in the expected speedups (3x-4x, and much more soon), the CUDA runtime didn
96.
by LightMachine 2y ago
It was actually just me recording iTerm2 with OBS. The theme is Solarized Light. What do you mean by skip commands?
97.
by LightMachine 2y ago
Also, I wonder if you will agree with me, but I'm perhaps too bothered by this title? We'd probably use something more mundane, like: - Bend: a high-level language that runs on GPUs, powered by HVM2 Or something similar. I don&#x2
98.
by LightMachine 2y ago
Hey, Taelin here. Thanks for posting, but our URL is wrong, it should be: HigherOrderCO.com. I can't post it again (gets flagged as a duplicate). Would appreciate if HN mods could change it! Anyway, after years of hard work, HVM2 is fi
99.
~(hvm-page.pages.dev)
1 points by LightMachine 2y ago|0 comments
100.
by LightMachine 2y ago
Oh my point was NOT that LLMs can't simulate a Turing machine reliably. I was just replying to the tweet above. The main point of this (speculative) text is that GPTs can "evolve a general learner" inside them, but are unab
101.
Claude-3 emulates Pokémon Red(twitter.com)
3 points by LightMachine 2y ago|0 comments
102.
PSA: GPT-4 Is Obsolete(twitter.com)
2 points by LightMachine 3y ago|0 comments
103.
by LightMachine 3y ago
As a Brazilian, I approve that choice. Vambora amigos!
104.
by LightMachine 3y ago
Gemini Ultra release day, and a minor post on ollama OpenAI compatibility gets more points lol
105.
by LightMachine 3y ago
I would love to, if YCombinator allowed me. The "edit" button is missing. I've edited on Reddit and other places where I posted this test.
106.
by LightMachine 3y ago
Don't blame Google. Blame "Play Store". Probably the company behind it doesn't want Gemini to succeed.
107.
by LightMachine 3y ago
> How hard can it be to just scan some documentation and code every few weeks? oh dear...
108.
by LightMachine 3y ago
Oh fuck. Well, in my defense, nobody is claiming I'll design fusion reactors and cure cancer by 2027
109.
by LightMachine 3y ago
ERRATA: I just noticed GPT-4 mixed up `h` and `f`, so it also got it wrong. This is a draw. Both AIs (and, apparently, myself) are terrible at reasoning. Guess we're not curing cancer with computers anytime soon :')
110.
by LightMachine 3y ago
Oh, lol, you're right. Seems like I'm dumber than both AIs. GPT-4 mixed up `h` and `f`, so it also got it wrong, so this is a draw and both AIs (and, apparently, myself) are terrible at reasoning. Guess we're not curing cance
111.
by LightMachine 3y ago
AGI implies there are no cognitive tasks that some humans can perform, yet that this AI can not perform. Otherwise, what is the point?
112.
by LightMachine 3y ago
Anyone familiar with the syntax / jargon should be able to answer this specific problem in ~5 seconds of thinking, though. And I mean it, even a 10yo kid should...
113.
by LightMachine 3y ago
That's fair enough
114.
by LightMachine 3y ago
No, it is `n * 3`. The challenge is simple: starting from "1", we must reach "17" by combining the operations `x * 3`, `x * 2` and `x + 5`. What is embarrassing is that Gemini manages to read the formal jargon and unders
115.
by LightMachine 3y ago
You're completely wrong. Gemini can perfectly understand what is being asked, so this isn't a syntax issue. Notice that, on the answer, it even states the solution: "starting from 1, and combining `* 2`, `* 3` and `+ 5`, we m
116.
by LightMachine 3y ago
Being able to answer these questions is a pre-requisite for AGI. After all, there ARE humans capable of doing that, so, if the AI can't do it no matter how hard it tries, then that means there ARE human capabilities that the AI can&#x2
117.
by LightMachine 3y ago
Because once an AI becomes proficient at formalized logic, it: 1. Completely stops hallucinating, since we can demand it to internally prove its claims before showing the answer; 2. Stops outputting incorrect code (for the same reason); 3.
118.
by LightMachine 3y ago
If we want to test these beasts in logic, we should probably start using actual formalized logic, rather than English. In just one test, Gemini flopped hard, while GPT-4-Turbo nailed it. Here is my prompt: Below is a well-typed CoC fu
119.
Can a simple functional sieve be fast? Optimizing Tromp's algorithm on HVM(gist.github.com)
3 points by LightMachine 3y ago|0 comments
120.
SAT can be solved surprisingly quickly via superposed bools on Interaction Nets(gist.github.com)
6 points by LightMachine 3y ago|1 comments

More ›