Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6186Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Paterson, Michael Stewart | - |
| dc.date | 2004-10-04T14:44:36Z | - |
| dc.date | 2004-10-04T14:44:36Z | - |
| dc.date | 1967-08-01 | - |
| dc.date.accessioned | 2013-10-09T02:43:51Z | - |
| dc.date.available | 2013-10-09T02:43:51Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-211 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6186 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | A central problem in the mathematical teory of computers and computation is to find a suitable framework for expressing the ececution of a computer program by a computer. Within the framework we want to be alble to provide answers to such questions as; (1) Does a certain program perform a certain task? (2) Are two programs equivalent, i.e., do they perform the same task? (3) Under what conditions, if at all, will a program fail to help? (4) how can a given program be simplified, in some sense, or made more efficient? These kinds of questions are customarily answered by experienced intuition, for simple programs, supplemented by trial and, often error for more complicated ones. We should like to replace such methods by a formalizable procedure, capable of being carried out by a computer program. | - |
| dc.description | Issued November 1970 | - |
| dc.format | 58983047 bytes | - |
| dc.format | 3153295 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-211 | - |
| dc.title | Equivalence Problems in a Model of Computation | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.