Algorithms: A quest for absolute definitions

Algorithms: A quest for absolute definitions (2003)

by Andreas Blass , Yuri Gurevich

Venue:	Bulletin of the European Association for Theoretical Computer Science
Citations:	13 - 6 self

Datum	Value	Source
TITLE	Algorithms: A quest for absolute definitions	INFERENCE
AUTHOR NAME	Andreas Blass	SVM HeaderParse 0.2
AUTHOR AFFIL	\Lambda	SVM HeaderParse 0.2
AUTHOR NAME	Yuri Gurevich	SVM HeaderParse 0.2
ABSTRACT	y Abstract What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the Church-Turing thesis and contrast Church's and Turing's approaches, and we finish with some recent investigations.	SVM HeaderParse 0.2
YEAR	2003	INFERENCE
VENUE	Bulletin of the European Association for Theoretical Computer Science	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
CITATIONS	51 found	ParsCit 1.0