A Theory of Justified Reformulations | SpringerLink
Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 87)) 109 Accesses 15 Citations Present day systems, intelligent or otherwise, are limited by the conceptualizations of the world given to them by their designers. In this paper, we propose a novel, first-principles approach to performing incremental reformulations for computational efficiency. First, we define a reformulation to be a shift in conceptualization: a change in the basic objects, functions, and relations assumed in a formulation. We then analyze the requirements for automating reformulation and show the need for justifying shifts in conceptualization. Inefficient formulations make irrelevant distinctions. A new class of meta-theoretical justifications for a reformulation called irrelevance explanations, is presented. A logical irrelevance explanation demonstrates that certain distinctions made in the formulation are not necessary for the computation of a given class of
Abstract Present day systems, intelligent or otherwise, are limited by the conceptualizations of the world given to them by their designers. In this paper, we propose a novel, first-principles approach to performing incremental reformulations for computational efficiency. First, we define a reformulation to be a shift in conceptualization: a change in the basic objects, functions, and relations assumed in a formulation. We then analyze the requirements for automating reformulation and show the need for justifying shifts in conceptualization. Inefficient formulations make irrelevant distinction
Explore this link on the map →related reading
- How To Think Real Good | Meta-rationalitymetarationality.com
- Computation in Physical Systems (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Rationalization — LessWronglesswrong.com
- E.W. Dijkstra Archive: On the cruelty of really teaching computing science (EWD 1036)cs.utexas.edu
- 2510.01346arxiv.org
- [2510.01346] Aristotle: IMO-level Automated Theorem Provingarxiv.org
- Occam’s Razorreadthesequences.com
- A Technical Introduction to Solomonoff Induction without K-Complexity — LessWronglesswrong.com
- Forms of life, forms of mind | Dr. Michael Levin | Algorithms Redux: finding unexpected properties in truly minimal systemsthoughtforms.life
- Integrated information theory (IIT) 4.0: Formulating the properties of phenomenal existence in physical terms - PMCncbi.nlm.nih.gov
- Conjecture, Criticism, and the Structure of a Mindellahoeppner.substack.com
- Logical decision theories — LessWrongarbital.com