Latest Research in Algorithmic Information Geometry

Top Research Topics in Algorithmic Information Geometry

• Data Structures and Algorithms — 66 papers
• Computability, Logic, AI Algorithms — 49 papers
• Formal Languages and Automata Theory — 35 papers
• Logic in Computer Science — 29 papers
• Computational Complexity — 28 papers
• Combinatorics — 21 papers
• Logic — 21 papers
• Complexity and Algorithms in Graphs — 13 papers
• Computer Science and Game Theory — 13 papers
• Computational Geometry — 12 papers

Highest-Cited Papers

1. The Inherent Limits of Formal Systems: Undecidability and Incompleteness — E8 Intelligence Research
2. The Inherent Limits of Formal Systems: Undecidability and Incompleteness — E8 Intelligence Research
3. An Exponential Value-Oracle Lower Bound for \({k}\)-Submodular Function Minimization
4. What Is a Syntax? Intrinsic Generation and the Finitary Generation Thesis
5. Subset selection problems in planar point sets
6. KNOCKING DOWN BOXES: THE FMP FOR K ⊕ ◻ m + k p → ◻ m p $\mathbf {K}\oplus \Box ^{m+k} p\to \Box ^m p$ bold upper K circled plus white medium square Superscript m plus k Baseline p right arrow white medium square Superscript m Baseline p
7. The Bottom of the Shub–Smale Tau Conjecture: an Exact Census of Integer Roots for Constant-Free Straight-Line Programs of Length at Most Eight
8. NEXP-Completeness of Existential Presburger Arithmetic with Divisibility
9. COMPUTABLE SCOTT SENTENCES AND THE FRIEDMAN–STANLEY EMBEDDING
10. Locality Causes Tractability? An Intervention Study on the Variable-Interaction Radius in Geometric Random Satisfiability (Compact Version)
11. The set-theoretic Kaufmann–Clote question
12. Genuinely Non-traditional Logics
13. Locality Causes Tractability? An Intervention Study on the Variable-Interaction Radius in Geometric Random Satisfiability (Compact Version)
14. Streaming Hypergraph Coloring via Palette Sparsification
15. A Separation Between Distribution-Free SQ Learning and Dimension Complexity
16. Reintroducing the Second Player in EPR
17. The Stretch Factor of Planar Delaunay Triangulations Is Less Than 1.65
18. A sampling Lovász Local Lemma
19. Kim-forking for hyperimaginaries in NSOP1 theories
20. Paths maximize the expected range of graph-indexed random walks

Sub-Regions

• Computational Complexity — 96 papers
• Data Structures and Algorithms — 69 papers
• Computability, Logic, AI Algorithms — 49 papers
• Formal Languages and Automata Theory — 44 papers
• Logic in Computer Science — 36 papers
• Constraint Satisfaction and Optimization — 32 papers