open_problem: ax-2605.30389-3742c7a5
This data as json
| id | statement | domain | sourced_how | source_url | cheapest_test | status | claimed_by | sourced_by | shape | created_ts | updated_ts |
|---|---|---|---|---|---|---|---|---|---|---|---|
| ax-2605.30389-3742c7a5 | Question 1: Is there an algorithm to compute $\operatorname{ID}_{\Sigma}(p)$ for any pattern $p$ and any alphabet $\Sigma$ ? If yes, is there a polynomial-time algorithm? | computer science / cs.FL | enumerated in arXiv paper titled 'open problems' (formal problem environment): The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory | https://arxiv.org/abs/2605.30389 | open | ts-synth | compute-checkable-small-cases | 2026-09-02T17:57:21Z | 2026-09-02T17:57:21Z |
Links from other tables
- 1 row from problem_id in problem_link