6039 位用户此时在线
24小时点击排行 Top 10：
- 本站自动实时分享网络热点
- 24小时实时更新
- 所有言论不代表本站态度
- 欢迎对信息踊跃评论评分
- 评分越高，信息越新，排列越靠前
2
1
0
6
2
1
1
11
2
1
1
12
2
1
1
13
Grok 4 Heavy (left) V.s. Gemini 2.5 Pro (right)
2
1
1
Grok 4 Heavy (left) V.s. Gemini 2.5 Pro (right)
Create a Turing-complete Scheme interpreter in C that supports lexical scoping, closures, continuations, and proper tail-call for tail recursion without stack growth.
Grok4 won. It wrote superior code.
Grok4 Heavy: 903 Lines of C
btc
(
twitter.com)
•
Tetsuo
14
3
2
2
15
2
1
1
16
This is why the left can’t meme. You can’t compress the ever-branching tree of lies into something people instinctively understand & resonate with (like an image). Instead, you have to use language—either trained mantras or paragraphs—to trigger sequential cognitive routines that
2
1
1
This is why the left can’t meme. You can’t compress the ever-branching tree of lies into something people instinctively understand & resonate with (like an image). Instead, you have to use language—either trained mantras or paragraphs—to trigger sequential cognitive routines that
btc
(
twitter.com)
•
ℜ𝔞𝔢
17
2
1
1
18
2
1
1
19
2
1
1
20
2
1
1
21
2
1
1