<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>8777</REFNUM><AUTHORS><AUTHOR>Cockshott,W.P.</AUTHOR><AUTHOR>Mackenzie,L.</AUTHOR><AUTHOR>Michaelson,G.</AUTHOR></AUTHORS><YEAR>2008</YEAR><TITLE>Physical constraints on hypercomputation</TITLE><PLACE_PUBLISHED>Theoretical computer science (2008) doi:10.1016/j.tcs.2007.12.009</PLACE_PUBLISHED><PUBLISHER>Elsevier Science</PUBLISHER><LABEL>Cockshott:2008:8777</LABEL><KEYWORDS><KEYWORD>hypercomputation</KEYWORD></KEYWORDS<ABSTRACT>TE D Many attempts to transcend the fundamental limitations to computability implied by the Halting Problem for Turing Machines 4 depend on the use of forms of hypercomputation that draw on notions of in?nite or continuous, as opposed to bounded or discrete, 5 computation. Thus, such schemes may include the deployment of actualised rather than potential in?nities of physical resources, or of physical representations of real numbers to arbitrary precision. Here, we argue that such bases for hypercomputation are not materially realisable and so cannot constitute new forms of effective calculability.</ABSTRACT><URL>http://www.dcs.gla.ac.uk/~wpc/reports/tcsa.pdf</URL></RECORD></RECORDS></XML>