Fundamentals of Computation Theory: Proceedings of the 1977 International Fct-Conference, Poznán-Kórnik, Poland, September 19-23, 1977
Marek Karpiński (ed.)
Springer-Verlag (1977)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | Recursion theory Computational complexity Machine theory Categories (Mathematics | |||||||||
| Categories | ||||||||||
| Buy the book | $8.72 used Amazon page | |||||||||
| Call number | QA9.6.I57 1977 | |||||||||
| ISBN(s) | 0387084428 | |||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links | This entry has no external links. Add one. |
| Through your library | Configure |
Arto Salomaa (1985). Computation and Automata. Cambridge University Press.
Gregory J. Chaitin (1970). Computational Complexity and Godel's Incompleteness Theorem. [Rio De Janeiro,Centro Técnico Científico, Pontifícia Universidade Católica Do Rio De Janeiro.
S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
Ivan Moura & Pierre Bonzon (2004). A Computational Framework for Implementing Baars' Global Worslaoce Theory of Consciousness. In Proceedings Conference of Brain Inspired Cognitive Systems (BICS),.
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
Gerd Wechsung (ed.) (1984). Frege Conference 1984: Proceedings of the International Conference Held at Schwerin, Gdr, September 10-14, 1984. Akademie-Verlag.
Jens Erik Fenstad, R. O. Gandy & Gerald E. Sacks (eds.) (1978). Generalized Recursion Theory Ii: Proceedings of the 1977 Oslo Symposium. Sole Distributors for the U.S.A. And Canada, Elsevier North-Holland.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |

