Post #2904232
2023-08-03 22:34 UTC
ACT 1: We introduce a hypothetical engineer, Dr. Ingenia, who wants to make human (-like or level) AI using ML. We grant highly simplified and idealised conditions (perfect data, access to all ML methods present & future, low bar) and formalise the AI-by-Learning problem. 6/n
Replies (1)
-
@Iris@scholar.social 2023-08-03 22:36
ACT 1 (cont'd): We present The Ingenia Theorem: AI-by-Learning is intractable (formally, NP-hard). The proof is by reduction from a known NP-hard problem (in this case Perfect-vs-Chance, proven intractable by Hirahara, 2022). See APPENDIX for full details. 7/n