Report 1


Report presentation (pdf) here



Report Outline

1. Introduction - The Notion of Cost
2. Resource-bounded Algorithms
3. Super Turing Models

4. $-Calculus Model Properties
5. The K-Omega Optimization Search Algorithm
6. Solving Problems using $-Calculus Model
7. $-Calculus Complexity and Decidability

References

[1] Turing's Ideas and Models of Computation. Eberbach, Eguene, et.al,  University of Massachussetts, North Dartmouth MA
[2] $-Calculus Bounded Rationality = Process Algebra + Anytime Algorithms. Eberbach, Eugene. Acadia University, Canada
[3] Expressiveness of $-Calculus:What Matters?. Eberbach, Eugene. Acadia University, Canada
[4] On Designing CO$T: A New Approach  and Programming Environment for Distributed Problem Solving Based on Evolutionary Computation and Anytime Algorithms. Eberbach, Eugene. University of Massachussetts, North Dartmouth MA
[5] The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems. Eberbach, Eugene. University of Massachussetts, North Dartmouth MA
Comments