Generalised solutions and law of conservation of difficulty (2008)
terrytao.wordpress.com·4h·
Discuss: Hacker News
🔗Concatenative Theory
An Age of AI Enlightenment
xiangfu.co·5h·
Discuss: Hacker News
Effect Inference
Zero-Based Numbering
en.wikipedia.org·11h·
Discuss: Hacker News
🪢Rope Data Structures
Revel Part 2: Building a DSL for Canvas Automation in C
velostudio.github.io·10h·
💬REPL Design
Knowledge Homophily in Large Language Models
arxiv.org·1d
🪜Recursive Descent
RoleConflictBench: A Benchmark of Role Conflict Scenarios for Evaluating LLMs' Contextual Sensitivity
arxiv.org·4h
🔗Lexical Scoping
How to Make Large Language Models Generate 100% Valid Molecules?
arxiv.org·1d
🎯Finite Automata
MARCOS: Deep Thinking by Markov Chain of Continuous Thoughts
arxiv.org·1d
🪜Recursive Descent
From Monolith to Monorepo: Building Faster with Turborepo, pnpm and Capacitor
dev.to·1d·
Discuss: DEV
📦Monorepos
Making sense of parameter-space decomposition
lesswrong.com·3d
🔢Algebraic Datatypes
Deceive, Detect, and Disclose: Large Language Models Play Mini-Mafia
arxiv.org·1d
🌱Minimal ML
Not Wrong, But Untrue: LLM Overconfidence in Document-Based Queries
arxiv.org·4h
⚖️Weighted Automata
Knowledge-Level Consistency Reinforcement Learning: Dual-Fact Alignment for Long-Form Factuality
arxiv.org·1d
🪜Recursive Descent
How I Built a Private, Multi-User “Chat with Your Documents” App That Runs 100% Offline
dev.to·14h·
Discuss: DEV
💬Smalltalk VMs
Paired by the Teacher: Turning Unpaired Data into High-Fidelity Pairs for Low-Resource Text Generation
arxiv.org·1d
🌱Minimal ML
RADAR: Reasoning-Ability and Difficulty-Aware Routing for Reasoning LLMs
arxiv.org·4h
🌱Minimal ML