Functionally Complete Machines

Simple item page
dc.contributor.authorWesselkamper, Thomas C.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:35:58Zen
dc.date.available2013-06-19T14:35:58Zen
dc.date.issued1973en
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.identifierhttp://eprints.cs.vt.edu/archive/00000750/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000750/01/CS73005-R.pdfen
dc.identifier.trnumberCS73005-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20252en
dc.language.isoenen
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.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS73005-R.pdf
Size:
412.41 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports