Quoting Jochen Fromm <[EMAIL PROTECTED]>: > What is the equivalent to > axioms, theorems, lemmas and deductive proofs in the NKS of > ABMs ?
I don't know where it ends, but it must start with the correctness of the implementation of a simulation (the verification of the model realization). In general I don't think they can exist because of issues like the Halting Problem. Perhaps recursion theory could say something about when a simulation is computing something interesting and unattainable in a more compact way... http://en.wikipedia.org/wiki/Halting_problem http://en.wikipedia.org/wiki/Recursion_theory ============================================================ FRIAM Applied Complexity Group listserv Meets Fridays 9a-11:30 at cafe at St. John's College lectures, archives, unsubscribe, maps at http://www.friam.org
