Introduction to computability theory

dc.contributor.author	Zucker, J
dc.contributor.author	Pretorius, L
dc.date.accessioned	2018-05-28T13:32:19Z
dc.date.available	2018-05-28T13:32:19Z
dc.date.issued	1993
dc.identifier.citation	Zucker J & Pretorius L (1993) Introduction to computability theory. South African Computer Journal, Number 9, 1993	en
dc.identifier.issn	2313-7835
dc.identifier.uri	http://hdl.handle.net/10500/24126
dc.description.abstract	These are notes for a short introductory course on Computability Theory (or recursive function theory). The basic notion of computability is defined in terms of a simple imperative programming language.	en
dc.language.iso	en	en
dc.publisher	South African Computer Society (SAICSIT)	en
dc.subject	Computability	en
dc.subject	Recursion	en
dc.subject	Primitive recursion	en
dc.subject	Church-Turing thesis	en
dc.subject	Recursive enumerability	en
dc.title	Introduction to computability theory	en
dc.type	Article	en