Post #2904233
2023-08-03 22:36 UTC
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
Replies (1)
-
@Iris@scholar.social 2023-08-03 22:37
ACT 1 (cont'd) Even if AI-by-Learning may be practically solvable for simple situations (small n), any attempts to scale up to situations of real-world, human-level complexity (medium to large n) will necessarily consume an astronomical amount of resources (see Box 1). 8/n