<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>8246</REFNUM><AUTHORS><AUTHOR>Michaelson,G.</AUTHOR><AUTHOR>Cockshott,W.P.</AUTHOR></AUTHORS><YEAR>2006</YEAR><TITLE>Constraints on Hypercomputation</TITLE><PLACE_PUBLISHED>Logical Approaches to Computational Barriers Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings</PLACE_PUBLISHED><PUBLISHER>Springer Verlag</PUBLISHER><ISBN>ISBN: 3-540-35466-2</ISBN><LABEL>Michaelson:2006:8246</LABEL><ABSTRACT>Wegner and Eberbach 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 $\pi$calculus.</ABSTRACT></RECORD></RECORDS></XML>