Show simple item record

dc.contributor.authorWesselkamper, Thomas C.en
dc.date.accessioned2013-06-19T14:35:58Zen
dc.date.available2013-06-19T14:35:58Zen
dc.date.issued1973en
dc.identifierhttp://eprints.cs.vt.edu/archive/00000750/en
dc.identifier.urihttp://hdl.handle.net/10919/20252en
dc.description.abstractThis paper defines a functionally complete machine as a machine which is capable of evaluating every two place function over its data space. Necessary conditions on memory size for completeness are developed. These conditions are applied to System/360 as modelled by the space of bytes, the space of halfwords, and the space of words. Sufficiently large (> 64K bytes) models of System/360 are shown to be complete for the space of bytes. No models of System/360 are complete for the spaces of halfwords or words. The inequalities developed and known examples of universal decision elements suggest structures for complete machines.en
dc.format.mimetypeapplication/pdfen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleFunctionally Complete Machinesen
dc.typeTechnical reporten
dc.contributor.departmentComputer Scienceen
dc.identifier.trnumberCS73005-Ren
dc.type.dcmitypeTexten
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000750/01/CS73005-R.pdfen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record