منابع مشابه
Computational Abstraction Steps
In this paper we discuss computational abstraction steps as a way to create class abstractions from concrete objects, and from examples. Computational abstraction steps are regarded as symmetric counterparts to computational concretisation steps, which are well-known in terms of function calls and class instantiations. Our teaching experience shows that many novice programmers find it difficult...
متن کاملSteps Toward a Computational
In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in prover9 (a first-order automated reasoning system which is the successor to otter). After reviewing the second-ord...
متن کاملSteps Toward a Computational Metaphysics
In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in prover9 (a first-order automated reasoning system which is the successor to otter). After reviewing the second-ord...
متن کاملComputational visualization - graphics, abstraction, and interactivity
If you get the printed book in on-line book store, you may also find the same problem. So, you must move store to store and search for the available there. But, it will not happen here. The book that we will offer right here is the soft file concept. This is what make you can easily find and get this computational visualization graphics abstraction and interactivity by reading this site. We off...
متن کاملCalibrating Computational Feasibility by Abstraction Rank
We characterize computationally the functions provable in second order logic with set existence restricted to natural classes of rst order formulas. A classi cation of rst-order set-existence by implicational rank yields a natural hierarchy of complexity classes within the class of Kalmar-elementary functions: The functions over f0; 1g constructively provable using set existence for formulas of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Object Technology
سال: 2010
ISSN: 1660-1769
DOI: 10.5381/jot.2010.9.6.a1