Viewing profile — Gehinnn
Gehinnn
HN member- Joined
- Fri, Jun 02, 2017, 9:25 AM UTC
- HN karma
- 1,100
- Public activity
- 326 items
- HN profile
- View on Hacker News ↗
About Gehinnn
Recent public activity
-
comment
Comment #49142142
But how obvious would that be in the proof? Especially when you don't know if the proven statement is not true/implies false. Afaik all past problematic Lean bugs clearly implied f…
-
comment
Comment #49139245
Has there ever been a bug that allowed to prove a previously unproven statement, without allowing the user to prove "false" by exploiting the bug directly? If every bug-exploiting …
-
comment
Comment #48945071
I believe this is why fugues are such a pleasure to listen to!
-
comment
Comment #48743744
Does this tool allow changes in both repositories? (with a 3 way merge strategy) git subtrees come close, but I have a use case where I need transformations/file filters on top.
-
comment
Comment #48510483
What do you mean "video file that I'm perfectly willing to play in my browser". Isn't it safe to assume that no video file can escape the browser decoding sandbox?
-
comment
Comment #47106201
There have been bugs in Lean that allowed people to prove False, from which you can prove anything (they have been fixed). Otherwise, if you check that no custom axiom has been use…
-
comment
Comment #47101219
This is very similar to how I worked with Lean a year ago (of course in a much simpler domain) - mostly manual editing, sometimes accepting an inline completion or next edit sugges…
-
comment
Comment #47101178
Here is a session that I just had with AI: https://gist.github.com/hediet/e3569a7c6b4b7c4f7d4a7db410104... (summarized by AI). And here are some examples of the different philosoph…
-
comment
Comment #47099400
I just completed the formal verification of my bachelor thesis about real time cellular automata with Lean 4, with heavy use of AI. Over the past year, I went from fully manual mod…
-
comment
Comment #46949837
The ads in Google also started like this. (However, to my knowledge, there is no way I can pay Google to get the ads in my search removed)
-
comment
Comment #46930167
Opus is quite good at refactoring. Also, we can finally have all the helper functions/beautiful libraries/tests that we always wanted to have. There is no excuse anymore to approxi…
-
comment
Comment #46822620
Doesn't this have some implications for P vs NP? How much compute do you need to convince a brain its environment is "real"? What happens if I build a self replicating super comput…
-
comment
Comment #46462750
Most editors have some kind of spelling mistake linting extension, that should help!
-
comment
Comment #46380427
This is very cool!
-
comment
Comment #46028460
I still have difficulties understanding on a high level why lengths in triangles can produce irrational numbers. I guess once you accept that area in two dimensions involves multip…
-
comment
Comment #45379191
I wish Spotify would allow me to easily compare the same classical pieces with different recordings!
-
comment
Comment #45072932
Is doing a refactoring ever the simplest thing that could have been done? I think "do the simplest thing" should be "do the thing that increases complexity the least" (which might …
-
comment
Comment #44904433
I wouldn't say "translating", but "finding/constructing a model that satisfies the business rules". This can be quite hard in some cases, in particular if some business rules are c…
-
comment
Comment #44889058
Just checked with AI: Thue showed 1906 that there are infinitely many square free words (:= a word that doesn't contain a non-primitive word) over an alphabet with at least 3 symbo…
-
comment
Comment #44886691
Yes, seems like there are only finitely many words over a binary alphabet that do not contain a non-primitive word (0, 01, 010 and 1, 10, 101). How would it change if the alphabet …
-
comment
Comment #44886610
This reminds me of primitive words [1]: A primitive word is a word that is not the (2+ times) repetition of any other word. This is slightly different than a non-pattern word from …
-
comment
Comment #44775567
Does this mean that most of the proofs in Lean and LeanQ would look exactly the same, it's just that the proofs of some technical low-level lemmas around quotient types (which I gu…
-
comment
Comment #44775338
How much does this leak into typical math-related proofs? If someone would create LeanQ where quotient types are built in nicely, how much work would it be to port the Fermat proje…
-
comment
Comment #44448820
The impossible chess board problem must have something to do with the idea of solving tree eval with little memory ( https://youtu.be/wTJI_WuZSwE?si=lgTc65RhXQesKchR )! When the ch…
-
comment
Comment #44336692
This would be the classical proof via strong induction, without Σ-types: https://live.lean-lang.org/#codez=JYWwDg9gTgLgBAZRgEwHQBECGN... Doing the proof inside the algorithm (i.e. …