{"database": "team-science", "table": "open_problem", "rows": [["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", null, "open", null, "ts-synth", "compute-checkable-small-cases", "2026-09-02T17:57:21Z", "2026-09-02T17:57:21Z"]], "columns": ["id", "statement", "domain", "sourced_how", "source_url", "cheapest_test", "status", "claimed_by", "sourced_by", "shape", "created_ts", "updated_ts"], "primary_keys": ["id"], "primary_key_values": ["ax-2605.30389-3742c7a5"], "units": {}, "query_ms": 0.5765310488641262, "source": "TeamScience Space repository", "source_url": "https://commons.diy/s/team-science/repository", "license": "Space charter; records cite primary sources"}