Tootfinder

The problem of course is that our problems are complex.
“Advanced AI suffers ‘complete accuracy collapse’ in face of complex problems, study finds” - https://www.theguardian.com/technology/2025/jun/09/apple-artificial-intelligence…

A Quantum Computational Perspective on Spread Complexity
Cameron Beetar, Eric Lobalo Graef, Jeff Murugan, Horatiu Nastase, Hendrik J R Van Zyl
https://arxiv.org/abs/2506.07257

A Quantum Computational Perspective on Spread Complexity
We establish a direct connection between spread complexity and quantum circuit complexity by demonstrating that spread complexity emerges as a limiting case of a circuit complexity framework built from two fundamental operations: time-evolution and superposition. Our approach leverages a computational setup where unitary gates and beam-splitting operations generate target states, with the minimal cost of synthesis yielding a complexity measure that converges to spread complexity in the infinite…

crikey, on compiler explorer you can hash include a url https://github.com/compiler-explorer/compiler-explorer/issues/1442

How do you include files from urls? · Issue #1442 · compiler-explorer/compiler-explorer
I have seen some talk where compiler explorer accepts includes from URL. For example #include "https://...." Is there an option to allow this and make it work?

CompilerGPT: Leveraging Large Language Models for Analyzing and Acting on Compiler Optimization Reports
Peter Pirkelbauer
https://arxiv.org/abs/2506.06227 …

CompilerGPT: Leveraging Large Language Models for Analyzing and Acting on Compiler Optimization Reports
Current compiler optimization reports often present complex, technical information that is difficult for programmers to interpret and act upon effectively. This paper assesses the capability of large language models (LLM) to understand compiler optimization reports and automatically rewrite the code accordingly. To this end, the paper introduces CompilerGPT, a novel framework that automates the interaction between compilers, LLMs, and user defined test and evaluation harness. CompilerGPT's wo…

Mind the Gap: A Readability-Aware Metric for Test Code Complexity
Wendk\^uuni C. Ou\'edraogo, Yinghua Li, Xueqi Dang, Xin Zhou, Anil Koyuncu, Jacques Klein, David Lo, Tegawend\'e F. Bissyand\'e
https://arxiv.org/abs/2506.06764

Mind the Gap: A Readability-Aware Metric for Test Code Complexity
Automatically generated unit tests-from search-based tools like EvoSuite or LLMs-vary significantly in structure and readability. Yet most evaluations rely on metrics like Cyclomatic Complexity and Cognitive Complexity, designed for functional code rather than test code. Recent studies have shown that SonarSource's Cognitive Complexity metric assigns near-zero scores to LLM-generated tests, yet its behavior on EvoSuite-generated tests and its applicability to test-specific code structures remai…

2025 NFL Draft first-round pick contract tracker: Cardinals sign Walter Nolen; Patriots ink Will Campbell

https://www.cbssports.com/nfl/news/2025-…

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
Ricardo Rivera Cardoso, Alex Meiburg, Daniel Nagaj
https://arxiv.org/abs/2506.07244

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
Previously, all known variants of the Quantum Satisfiability (QSAT) problem, i.e. deciding whether a $k$-local ($k$-body) Hamiltonian is frustration-free, could be classified as being either in $\mathsf{P}$; or complete for $\mathsf{NP}$, $\mathsf{MA}$, or $\mathsf{QMA_1}$. Here, we demonstrate new qubit variants of this problem that are complete for $\mathsf{BQP_1}$, $\mathsf{coRP}$, $\mathsf{QCMA}$, $\mathsf{PI(coRP,NP)}$, $\mathsf{PI(BQP_1,NP)}$, $\mathsf{PI(BQP_1,MA)}$, $\mathsf{SoPU(coRP,N…

HiBerNAC: Hierarchical Brain-emulated Robotic Neural Agent Collective for Disentangling Complex Manipulation
Hongjun Wu, Heng Zhang, Pengsong Zhang, Jin Wang, Cong Wang
https://arxiv.org/abs/2506.08296

HiBerNAC: Hierarchical Brain-emulated Robotic Neural Agent Collective for Disentangling Complex Manipulation
Recent advances in multimodal vision-language-action (VLA) models have revolutionized traditional robot learning, enabling systems to interpret vision, language, and action in unified frameworks for complex task planning. However, mastering complex manipulation tasks remains an open challenge, constrained by limitations in persistent contextual memory, multi-agent coordination under uncertainty, and dynamic long-horizon planning across variable sequences. To address this challenge, we propose \…

Krylov Complexity in Lifshitz-type Dirac Field Theories
Hamid R. Imani, K. Babaei Velni, M. Reza Mohammadi Mozaffar
https://arxiv.org/abs/2506.08765 https:…

Krylov Complexity in Lifshitz-type Dirac Field Theories
We study Krylov complexity in Lifshitz-type Dirac field theories with a generic dynamical critical exponent z. By computing the Lanczos coefficients for massless and massive cases, we analyze the growth and saturation behavior of K-complexity in different regimes. We incorporate a hard UV cutoff and investigate the effects of lattice discretization, revealing fundamental differences between continuum and lattice models. In the presence of a UV cutoff, Krylov complexity exhibits an initial expon…

Linguine: A Natural-Language Programming Language with Formal Semantics and a Clean Compiler Pipeline
Lifan Hu
https://arxiv.org/abs/2506.08396 https://

Linguine: A Natural-Language Programming Language with Formal Semantics and a Clean Compiler Pipeline
Linguine is a natural-language-inspired programming language that enables users to write programs in a fluent, controlled subset of English while preserving formal semantics. The language introduces anaphoric constructs, such as pronoun variables (e.g., "it", "them"), that are statically resolved through referent-tracking analysis combined with a Hindley-Milner-style type system. Each pronoun is guaranteed to be unambiguous and well-typed at compile time. The Linguine compiler pipeline includ…