Computability and Recursion

Computability and Recursion (1996)

by Robert I. Soare

Venue:	Bulletin of Symbolic Logic
Citations:	25 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Computability and Recursion	user correction - Legacy Corrections
AUTHOR NAME	Robert I. Soare	SVM HeaderParse 0.1
ABSTRACT	. We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful historical and conceptual analysis of computability and recursion we make several recommendations in section §7 about preserving the intensional differences between the concepts of "computability" and "recursion". Specifically we recommend that: the term "recursive" should no longer carry the additional meaning of "computable" or "decidable"	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE	Bulletin of Symbolic Logic	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	284--321	INFERENCE
VOLUME	2	INFERENCE
CITATIONS	105 found	ParsCit 1.0