Skip Navigation

The Computer Journal 1976 19(3):234-237; doi:10.1093/comjnl/19.3.234
© 1976 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Brady, J. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A programming approach to some concepts and results in the theory of computation

J. M. Brady *

Computing Centre, University of Essex, Wivenhoe Park, Colchester, UK

The benefits of a programming approach to the theory of computation are illustrated by considering a traditional proof, namely the equivalence of Turing's formalism and general recursive functions (GRF). In these terms, we are led to criticise the GRF and to give a programmer's view of the Kleene normal form theorem.

Received December 1973. revised May 1974.

* Computing Centre, University of Essex, Wivenhoe Park, Colchester, Essex.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.