Latest Research in Computability, Logic, AI Algorithms

Top Research Topics in Computability, Logic, AI Algorithms

• Computability, Logic, AI Algorithms — 9 papers
• Computational Complexity — 7 papers
• Formal Languages and Automata Theory — 7 papers
• Data Structures and Algorithms — 4 papers
• Logic in Computer Science — 3 papers
• Adversarial Robustness in Machine Learning — 2 papers
• Intelligence, Security, War Strategy — 2 papers
• Advanced Graph Theory Research — 2 papers
• DNA and Biological Computing — 1 papers
• Computational Geometry and Mesh Generation — 1 papers

Highest-Cited Papers

1. An Oracle Separating Conjectures about Incompleteness in the Finite Domain
2. An Operator Approach to Register Programs for Catalytic Computing
3. Induxion
4. Should Tables Be Sorted? Revisited with a Large Language Model
5. Tight Lower Bounds for Algebraic Communication and Applications
6. Coffee-Bean Maximality for Width-Normalized Label Systems: A Shift-Lipschitz Induction on Room Multisets
7. From NEMS to MFRR: { A Machine-Checked Bridge Between Semantic Closure and Reflexive Reality}
8. Compressed Subsequence Checking is PSPACE-complete
9. The Matroid Secretary Conjecture is True
10. Algorithms for Standard-form ILP Problems via Komlós' Discrepancy Setting (Refined $2^{O(k)}$-analysis)
11. Gödel's Limit: True but Unprovable Arithmetic Propositions — E8 Intelligence Research
12. Tree algebras and bisimulation-invariant MSO on finite graphs
13. Information asymmetry and incorrect classification of classes P and NP
14. A dual characterisation of simple and subdirectly-irreducible temporal Heyting algebras
15. Structural Depth in the 2011 IMO Windmill and Boolos Logic-Puzzle Variant — E8 Intelligence Research
16. Structural Depth in the 2011 IMO Windmill and Boolos Logic-Puzzle Variant — E8 Intelligence Research
17. Information asymmetry and incorrect classification of classes P and NP
18. Categorical Representations of Nice Automata and Their Subclasses
19. Golden Ratio as Fixed-Point Boundary in P vs NP Relativization — E8 Intelligence Research
20. QMA Lower Bounds for Batch Verification via Approximate Degree