Computation and Hypercomputation

Computation and Hypercomputation (2003)

by Mike Stannett

Venue:	MINDS AND MACHINES
Citations:	13 - 2 self

User correction supplied by mph

Datum	Value	Source
TITLE	Computation and Hypercomputation	SVM HeaderParse 0.1
AUTHOR NAME	Mike Stannett	user correction
AUTHOR AFFIL	Dept of Computer Science, Regent Court, University of Sheffield; 211 Portobello Street	user correction
AUTHOR ADDR	Sheffield S1 4DP, United Kingdom	user correction
ABSTRACT	Does Nature permit the implementation of behaviours that cannot be simulated computationally? We consider the meaning of physical computationality in some detail, and present arguments in favour of physical hypercomputation: for example, modern scientific method does not allow the specification of any experiment capable of refuting hypercomputation. We consider the implications of relativistic algorithms capable of solving the (Turing) Halting Problem. We also reject as a fallacy the argument that hypercomputation has no relevance because non-computable values are indistinguishable from sufficiently close computable approximations. In addition to	user correction
YEAR	2003	INFERENCE
VENUE	MINDS AND MACHINES	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	115--153	INFERENCE
VOLUME	13	INFERENCE
CITATIONS	40 found	ParsCit 1.0