Functionally Complete Machines

dc.contributor.author	Wesselkamper, Thomas C.	en
dc.contributor.department	Computer Science	en
dc.date.accessioned	2013-06-19T14:35:58Z	en
dc.date.available	2013-06-19T14:35:58Z	en
dc.date.issued	1973	en
dc.description.abstract	This 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.mimetype	application/pdf	en
dc.identifier	http://eprints.cs.vt.edu/archive/00000750/	en
dc.identifier.sourceurl	http://eprints.cs.vt.edu/archive/00000750/01/CS73005-R.pdf	en
dc.identifier.trnumber	CS73005-R	en
dc.identifier.uri	http://hdl.handle.net/10919/20252	en
dc.language.iso	en	en
dc.publisher	Department of Computer Science, Virginia Polytechnic Institute & State University	en
dc.relation.ispartof	Historical Collection(Till Dec 2001)	en
dc.rights	In Copyright	en
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/	en
dc.title	Functionally Complete Machines	en
dc.type	Technical report	en
dc.type.dcmitype	Text	en

Files

Now showing 1 - 1 of 1