Summary. This paper is based on a previous work of the first author [12] in which a mathematical model of the computer has been presented. The model deals with random access memory, such as RASP of C. C. Elgot and A. Robinson [11], however, it allows for a
FORMALIZEDMATHEMATICS
Volume3,Number2,1992
Universit´eCatholiquedeLouvain
AMathematicalModelofCPU
YatsukaNakamura
ShinshuUniversity
NaganoAndrzejTrybulec1WarsawUniversityBia lystok
Summary.Thispaperisbasedonapreviousworkofthe rst
author[12]inwhichamathematicalmodelofthecomputerhasbeen
presented.Themodeldealswithrandomaccessmemory,suchasRASP
ofC.C.ElgotandA.Robinson[11],however,itallowsforamorere-
alisticmodelingofrealcomputers.Thisnewmodelofcomputershas
beennamedbytheauthor(Y.Nakamura,[12])ArchitectureModelfor
Instructions(AMI).Itismoredevelopedthanpreviousmodels,bothin
thedescriptionofhardware(e.g.,theconceptoftheprogramcounter,the
structureofmemory)aswellasinthedescriptionofinstructions(instruc-
tioncodes,addresses).ThestructureofAMIoveranarbitrarycollection
ofmathematicaldomainsNconsistsof:
-anon-emptysetofobjects,
-theinstructioncounter,
-anon-emptysetofobjectscalledinstructionlocations,
-anon-emptysetofinstructioncodes,
-aninstructioncodeforhalting,
-asetofinstructionsthatareorderedpairswiththe rstelement
beinganinstructioncodeandtheseconda nitesequenceinwhich
membersareeitherobjectsoftheAMIorelementsofoneofthe
domainsincludedinN,
-afunctionthatassignstoeveryobjectofAMIitskindthatiseither
aninstructionoraninstructionlocationoranelementofN,
-afunctionthatassignstoeveryinstructionitsexecutionthatisagain
afunctionmappingstatesofAMIintothesetofstates.
ByastateofAMIwemeanafunctionthatassignstoeveryobjectof
AMIanelementofthesamekind.Inthispaperwedevelopthetheory
ofAMI.SomepropertiesofAMIareintroducedensuringittohavesome
propertiesofrealcomputers:
-avonNeumannAMI,inwhichonlyaddressestoinstructionlocations
arestoredintheprogramcounter,
-dataoriented,thoseinwhichinstructionscannotbestoredindata
locations,
-halting,inwhichtheexecutionofthehaltinstructionistheidentity
mappingofthestatesofanAMI,
-steadyprogrammed,theconditioninwhichthecontentsofthein-
structionlocationsdonotchangeduringexecution,
Université Catholique de Louvain A Model of ZF Set Theory Language Summary. The goal of this article is to construct a language of the ZF set ...
Université Catholique de Louvain Axioms of Incidency Borsuk and Wanda Szmielew ([1]). The fourth axiom of incidency is weakened. In [1] it has ...
Université Catholique de Louvain Binary Operations_专业资料。Summary. In this paper we define binary and unary operations on domains. We also define the...
Université Catholique de Louvain Tarski Grothendieck Set Theory_专业资料。Summary. This is the first part of the axiomatics of the Mizar system. It ...
FORMALIZED MATHEMATICS Number 1, January 1990 Universit? Catholique de Louvain e Families of Sets Beata Padlewska1 Warsaw University Bialystok Summary. The ...
Université catholique de Louvain Place du Cardinal Mercier, 10 B1347 Louvain-la-Neuve Belgique yves.bestgen@psp.ucl.ac.be *Max Planck Institute for ...
Université Catholique de Louvain The Lattice of Domains of a Topological Space 1 Toshihiko Summary. Let T be a topological space and let A be a ...
Université Catholique de Louvain Consequences of the Reflection Theorem ...(4) If M is a model of ZF, then M
Université Catholique de Louvain Monoid of Multisets and Subsets Summary. The monoid of functions yielding elements of a group is introduced. The monoid...
Université Catholique de Louvain Reper Algebras Summary. We shall describe...A standard model for the Euclidean geometry in the above sense is the ...
热门文档