EUROCAST
1997
Springer
14 years 8 months ago
1997
Springer
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
ATAL
2004
Springer
14 years 9 months ago
2004
Springer
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
ISAAC
2005
Springer
14 years 10 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...