@inproceedings{00b6183faf944c8fbab1a9698c0bbfd8,
title = "Constraints on hypercomputation",
abstract = "Wegner and Eberbach[16] have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called superTuring models. In this paper we contest their claims for interaction machines and the p-calculus. {\textcopyright} Springer-Verlag Berlin Heidelberg 2006.",
author = "Greg Michaelson and Paul Cockshott",
year = "2006",
doi = "10.1007/11780342_40",
language = "English",
isbn = "3540354662",
volume = "3988 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "378--387",
booktitle = "Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings",
note = "2nd Conference on Computability in Europe, CiE 2006 ; Conference date: 30-06-2006 Through 05-07-2006",
}