Finding Philosophy Puzzles Tractable by Compute but Underexplored Is Hard
birchlse · x · 2026-09-03
Replying to @anilkseth about a prize: the people behind it likely hope for something like the Jacobian conjecture result. The author notes it's genuinely hard to find philosophy puzzles that are tractable with judicious computational methods yet involve search spaces so big they remain underexplored.
Related event: Anil Seth Criticizes AI Philosophy Prize, Sparking Debate(4 posts)→
More from Research
- Valeo.ai Brings 5 ECCV 2026 Papers on Driving Video Prediction and LVLM Safety — abursuc · 2026-09-05
- VI3 anchors pretrained 3D foundation models to metric scale using only IMU readings — zhenjun_zhao · 2026-09-05
- ZipMVS compresses cost volumes for memory-efficient multi-view stereo reconstruction — zhenjun_zhao · 2026-09-05
- CP-Cert certifies outlier-robust pose registration up to 1000x faster than direct SDP solvers — zhenjun_zhao · 2026-09-05
- AutoCompass trains neural map matchers from raw GPS weak labels, outperforming strong-label baselines — zhenjun_zhao · 2026-09-05
- Unified bundle adjustment framework handles planes, vanishing points, and high-order geometric constraints at scale — zhenjun_zhao · 2026-09-05