nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithmic complexity of recursive and inductive algorithms
|
Burgin, Mark |
|
2004 |
317 |
1-3 |
p. 31-60 30 p. |
artikel |
2 |
Author index
|
|
|
2004 |
317 |
1-3 |
p. 269- 1 p. |
artikel |
3 |
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
|
Wiedermann, Jiřı́ |
|
2004 |
317 |
1-3 |
p. 61-69 9 p. |
artikel |
4 |
Continuous-time computation with restricted integration capabilities
|
Campagnolo, Manuel Lameiras |
|
2004 |
317 |
1-3 |
p. 147-165 19 p. |
artikel |
5 |
Editorial board v-ix
|
|
|
2004 |
317 |
1-3 |
p. v-ix nvt p. |
artikel |
6 |
Experience, generations, and limits in machine learning
|
Burgin, Mark |
|
2004 |
317 |
1-3 |
p. 71-91 21 p. |
artikel |
7 |
Hypercomputation by definition
|
Wells, Benjamin |
|
2004 |
317 |
1-3 |
p. 191-207 17 p. |
artikel |
8 |
Hypercomputation: philosophical issues
|
Copeland, B.Jack |
|
2004 |
317 |
1-3 |
p. 251-267 17 p. |
artikel |
9 |
Hypercomputation with quantum adiabatic processes
|
Kieu, Tien D. |
|
2004 |
317 |
1-3 |
p. 93-104 12 p. |
artikel |
10 |
Natural computation and non-Turing models of computation
|
MacLennan, Bruce J. |
|
2004 |
317 |
1-3 |
p. 115-145 31 p. |
artikel |
11 |
Super-tasks, accelerating Turing machines and uncomputability
|
Shagrir, Oron |
|
2004 |
317 |
1-3 |
p. 105-114 10 p. |
artikel |
12 |
The concept of computability
|
Cleland, Carol E. |
|
2004 |
317 |
1-3 |
p. 209-225 17 p. |
artikel |
13 |
The modal argument for hypercomputing minds
|
Bringsjord, Selmer |
|
2004 |
317 |
1-3 |
p. 167-190 24 p. |
artikel |
14 |
Three aspects of super-recursive algorithms and hypercomputation or finding black swans
|
Burgin, Mark |
|
2004 |
317 |
1-3 |
p. 1-11 11 p. |
artikel |
15 |
Toward a theory of intelligence
|
Kugel, Peter |
|
2004 |
317 |
1-3 |
p. 13-30 18 p. |
artikel |
16 |
Uncomputability: the problem of induction internalized
|
Kelly, Kevin T. |
|
2004 |
317 |
1-3 |
p. 227-249 23 p. |
artikel |