LightMachine

6 ms·

61.
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...
62.
by LightMachine 3y ago
That's fair enough
63.
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
64.
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
65.
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
66.
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.
67.
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
68.
Can a simple functional sieve be fast? Optimizing Tromp's algorithm on HVM(gist.github.com)
3 points by LightMachine 3y ago|0 comments
69.
SAT can be solved surprisingly quickly via superposed bools on Interaction Nets(gist.github.com)
6 points by LightMachine 3y ago|1 comments
70.
We can solve 3-SAT "quickly" via superposed booleans on interaction nets(twitter.com)
1 points by LightMachine 3y ago|0 comments
71.
by LightMachine 3y ago
Why don't you restrict the training just to old text? That would be awesome
72.
by LightMachine 3y ago
Why they write these articles like that? 10 pages long article about a proof... doesn't even mention what the proof is! Come on?
73.
by LightMachine 3y ago
No, they are completely awful at math. The way you can see that is that, whenever you ask it about known concepts, even hard ones, it will answer, making it look intelligent. But then if you create a small new theory or logical problem that
74.
by LightMachine 3y ago
Based on reports of Microsoft's CEO being "furious", and the size of its legal team, I'd bet the people's reaction wasn't exactly the most relevant factor there...
75.
by LightMachine 3y ago
Sorry how could MSFT hold the money hostage exactly? Isn't that kind of investment a big cash transfer directly to OAI's bank account? Genuinely curious
76.
by LightMachine 3y ago
Exactly. That kind of anti-scientific propaganda is dangerous. OP shouldn't have so many upvotes.
77.
by LightMachine 3y ago
I was underwhelmed, but I got -20 upvotes on Reddit for pointing it out. Yes products are cool, but I'm not following OpenAI for another App Store, I'm following it for AGI. They should be directing all resources to that. As Sam s
78.
by LightMachine 3y ago
Sorry I'm not sure I understand what Microsoft could possibly do if the board just stays firm on their decision. The non-profit owns the majority of the for profit, and the board has full control over the non-profit. Right? So at best
79.
by LightMachine 3y ago
Completely different situation. Jobs couldn't just fundraise for his new Oranges company, lure all the talent out of Apple and outcompete it at that point. Sam can do that to OpenAI in a blink if that's his plans.
80.
by LightMachine 3y ago
Even if they could, why would Sam accept it? The smartest move for Sam is to just start his own for-profit company, easily raise a fuckton of money, hire all the talents from OpenAI and carry on with whatever he was doing. I think this is O
81.
by LightMachine 3y ago
You completely miss OP's point. He is basically saying that the market value of Sam is appreciated regardless of his equity. And one example on how that is true is that whatever company Sam starts next will have an insanely high valuat
82.
by LightMachine 3y ago
We have built an entire real time game in Kind lang...
83.
by LightMachine 3y ago
I don't know, does Erlang elaborate to a simple core language?
84.
by LightMachine 3y ago
Yes but wouldn't be great. The problem is that these ultra low level assembly languages actually throw away a lot of information that is useful to parallelism. Recursive functions are great for HVM, but when compiled to assembly, that
85.
by LightMachine 3y ago
Yes that is the goal, but I'm not familiar enough with it to judge the complexity of such project. I do know GHCJS demanded tons of resource and efforts, so I do anticipate it will not be a simple task. That's why I want to suppor
86.
by LightMachine 3y ago
The ultimate goal is indeed to compile any code to GPUs, but we can't change the logic of your program. It is just a bunch of sequential loops, there isn't much we can do about it! But you can still use a Python-like syntax to cre
87.
by LightMachine 3y ago
Yes that is the ultimate goal! Although that is obviously a far future. Currently we only have funding to provide a few toy languages, but hopefully the results will be good enough to draw attention so we can scale and broaden support to mo
88.
by LightMachine 3y ago
We're providing support to all GPUs soon, NVidia is only the first target because it provides the most convenient language (CUDA).
89.
by LightMachine 3y ago
Exactly! Sorry if that sounded to be the case. We're first focusing on making the runtime as fast as possible. Next step is to support some simple toy lang (like a Haskell-like and a Python-like) for people to start using. Only then we
90.
by LightMachine 3y ago
Exactly, we're working on a guide for language designers. And while HVM-Core (the repo I posted today) is the lowest IR, I believe most languages should actually compile to HVM-Lang (to be released), which is a higher-level AST that is

More ›