
TL;DR
This paper introduces a new methodology for analyzing algorithms using expected discounted reward, enabling the assessment of partial and non-terminating algorithms, with potential applications in artificial general intelligence and automated theorem proving.
Contribution
It proposes an alternative analysis framework based on expected reward, suitable for partial algorithms and undecidable problems, expanding the scope of algorithm evaluation.
Findings
Methodology handles non-terminating algorithms
Applicable to analysis of AGI and theorem proving algorithms
Highlights challenges in practical algorithm intelligence scoring
Abstract
We present an alternative methodology for the analysis of algorithms, based on the concept of expected discounted reward. This methodology naturally handles algorithms that do not always terminate, so it can (theoretically) be used with partial algorithms for undecidable problems, such as those found in artificial general intelligence (AGI) and automated theorem proving. We mention an approach to self-improving AGI enabled by this methodology. Aug 2017 addendum: This article was originally written with multiple audiences in mind. It is really best put in the following terms. Goertzel, Hutter, Legg, and others have developed a definition of an intelligence score for a general abstract agent: expected lifetime reward in a random environment. AIXI is generally the optimal agent according to this score, but there may be reasons to analyze other agents and compare score values. If we want…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
