Even 8 years later, Dan's insights remain as valid as ever, yet there's precious little progress.
Even 8 years later, Dan's insights remain as valid as ever, yet there's precious little progress. One point that has always annoyed me: Exists x . x + 1 < x. While I can forgive C for this defect given the history, the fact that this is broken in even Haskell is mind boggling. At the very least this should trap, but preferably, like in Scheme, integers should by default be unbounded.
Posted by FullyFunctional on Mar 23, 2015, 11:10 PM
Tags
Related issues
- This is my biggest problem with agents, they constantly defensively code for cases that have no chance of happening and in most cases a p...
- I wish there was something like LEAN for biology.
- The issue is really the extreme difficulty of programming them, especially for anything sequential (rather than combinatorial).
- I probably could have beared with it if it was only limited to programming, but it showing up in creative fields has made me feel all sor...
- I hate that I'm in deep enough to know what you mean.
- The biggest problem with “AI” is that big corps are shoving it down our throats.
Raise real-world problems, find people facing the same issue, and discuss solutions.7,500 issues0 comments
reliability (Other)
This is my biggest problem with agents, they constantly defensively code for cases that have no chance of happening and in most cases a p...
I wish there was something like LEAN for biology.
The issue is really the extreme difficulty of programming them, especially for anything sequential (rather than combinatorial).
I probably could have beared with it if it was only limited to programming, but it showing up in creative fields has made me feel all sor...
I hate that I'm in deep enough to know what you mean.
The biggest problem with “AI” is that big corps are shoving it down our throats.
in the middel of a coding session with 5.6 sol.
[Hero Run] 535B-A23B on 18T tokens
Even 8 years later, Dan's insights remain as valid as ever, yet there's precious little progress.
Even 8 years later, Dan's insights remain as valid as ever, yet there's precious little progress. One point that has always annoyed me: Exists x . x + 1 < x. While I can forgive C for this defect given the history, the fact that this is broken in even Haskell is mind boggling. At the very least this should trap, but preferably, like in Scheme, integers should by default be unbounded.
Comments (0)
No comments yet. Start the discussion.