Recursion theory on the reals and continuous-time computation
Theoretical Computer Science - Special issue on real numbers and computers
Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
Communications of the ACM
Forget the past to win the future
Communications of the ACM
Beyond calculation
Relativistic Computers and Non-uniform Complexity Theory
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Didactic strategies for promoting significant learning in formal languages and automata theory
Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education
Preface: three aspects of super-recursive algorithms and hypercomputation or finding black swans
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Toward a theory of intelligence
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Experience, generations, and limits in machine learning
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Super-tasks, accelerating Turing machines and uncomputability
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
The modal argument for hypercomputing minds
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Hypercomputation: philosophical issues
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Theoretical Computer Science
Algorithmic complexity as a criterion of unsolvability
Theoretical Computer Science
Universality, reducibility, and completeness
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
| Hi-index | 48.22 |