Computability and Recursion

Computability and Recursion (1996)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Robert I. Soare

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

Versions

Version History

Metadata Version 2

Datum	Value	Source
TITLE	Computability and Recursiveness	INFERENCE
AUTHOR NAME	Robert I. Soare	SVM HeaderParse 0.1
AUTHOR AFFIL	1	SVM HeaderParse 0.2
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. 1 After a careful historical and conceptual analysis of computability and recursion we make several recommendations in section x7 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; " functions defined using Turing machines, register machines, or their variants should be called "computable " rather than "recursive; " we should distinguish the intensional difference between Church's Thesis and Turing's Thesis, and use the latter particularly in dealing with mechanistic questions; the name of the subject should be "Computability Theory " or simply Computability rather than "Recursive Function Theory."	SVM HeaderParse 0.1
YEAR	1996	INFERENCE
VENUE	Bulletin of Symbolic Logic	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	284--321	INFERENCE
VOLUME	3	INFERENCE
CITATIONS	82 found	ParsCit 1.0