Evolutionary processes in modeling and simulation
SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 3
Approximate reasoning in the algebra of bounded rational agents
International Journal of Approximate Reasoning
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Measuring testing as a distributed component of the software life cycle
Journal of Computational Methods in Sciences and Engineering
The church-turing thesis: consensus and opposition
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Inductive complexity of p versus NP problem
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Inductive complexity of goodstein's theorem
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
| Hi-index | 0.00 |
* The first exposition on super-recursive algorithms, systematizing all main classes and providingan accessible, focused examination of the theory and its ramifications *Demonstrates how these algorithms are more appropriate as mathematical models for modern computers and how they present a better framework for computing methods *Developsa new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole