arxiv
PublishedJune 1, 2026 at 4:00 AM
The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory
Publisher summary· verbatim
arXiv:2605.30389v1 Announce Type: cross Abstract: Pattern languages are a classical model in formal language theory and algorithmic learning theory. This note formulates the problem of computing the inclusion depth of a pattern language: the length of the longest strict inclusion chain from the univ
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSFMambaNet: Spectral-Frequency Enhanced Selective State Space Model for Correspondence Pruning19harxivOptical-Guided Neural Collapse for SAR Few-Shot Class Incremental Learning19harxivDynamic Infilling Anchors for Format-Constrained Generation in Diffusion Large Language Models19harxivTemporal Order Matters for Agentic Memory: Segment Trees for Long-Horizon Agents19hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗