Skip Navigation

The Computer Journal 1977 20(4):340-345; doi:10.1093/comjnl/20.4.340
© 1977 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 Levy, L. S.
Right arrow Articles by Melville, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The algebraic anatomy of programs

L. S. Levy1 and R. Melville2 §

1 Department of Statistics and Computer Science, University of Delaware, Newark, Delaware, USA, 2 Department of Computer Science, Cornell University, Ithaca, New York, USA

Game playing and backtracking programs among others can be understood in terms of algebraic operations with zeros. The special properties of the algebraic operations can be used to explain the equivalence of otherwise dissimilar algorithms.

Received April 1976.

* Currrent address: Department of Computer Science, Cornell University, Ithaca, New York

§ Department of Statistics and Computer Science, University of Delaware, Newark, Delaware 19711, USA


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.