A Computational Induction Principle
نویسنده
چکیده
It is critical to have an induction method for reasoning about re-cursive programs expressed as xed points, for otherwise our reasoning ability is severely impaired. The xed point induction rule developed by deBakker and Scott is one such well known principle. Here we propose a new induction method, computational induction , which is an induction on the computation process. Computational induction is founded on diierent principles than the xed point induction principle|it can only be deened in deterministic settings, and it cannot be modeled denotationally. Fixed point induction and computational induction prove many of the same facts; the relation between the two is examined in detail.
منابع مشابه
Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle
This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction principle.
متن کاملThe Principle of Mathematical Induction: A Viable Proof Technique for High School Students
This paper discusses the examination and study of the principle of mathematical induction. Specifically, we are interested in the idea of teaching the principle of mathematical induction to high school students as a viable proof method. Our goal for the project was to have the students learn how to write a correct mathematical proof as well as transition from the computational realm of mathemat...
متن کاملA computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induction, solves in principle the problem of optimal behavior of an intelligent agent. A practically most important and very challenging problem is to find a computationally efficient (if not optimal) approximation for the ...
متن کاملComputational Complexity and Induction for Partial Computable Functions in Type Theory
An adequate theory of partial computable functions should provide a basis for deening computational complexity measures and should justify the principle of computational induction for reasoning about programs on the basis of their recursive calls. There is no practical account of these notions in type theory, and consequently such concepts are not available in applications of type theory where ...
متن کاملUltimate Intelligence Part II: Physical Measure and Complexity of Intelligence
We investigate physical measures and limits of intelligence that are objective and useful. We propose a universal measure of operator induction fitness, and show how it can be used in a reinforcement learning model, and a self-preserving agent model based on the free energy principle. We extend logical depth and conceptual jump size measures to stochastic domains, and elucidate their relations....
متن کامل