Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3842021> ?p ?o }
Showing triples 1 to 50 of
50
with 100 triples per page.
- Q3842021 subject Q8646953.
- Q3842021 abstract "In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm development and algorithm complexity theory.The RASP is a random-access machine (RAM) model that, unlike the RAM, has its program in its "registers" together with its input. The registers are unbounded (infinite in capacity); whether the number of registers is finite is model-specific. Thus the RASP is to the RAM as the Universal Turing machine is to the Turing machine. The RASP is an example of the von Neumann architecture whereas the RAM is an example of the Harvard architecture.The RASP is closest of all the abstract models to the common notion of computer. But unlike actual computers the RASP model usually has a very simple instruction set, greatly reduced from those of CISC and even RISC processors to the simplest arithmetic, register-to-register "moves", and "test/jump" instructions. Some models have a few extra registers such as an accumulator.Together with the register machine, the RAM, and the pointer machine the RASP makes up the four common sequential machine models, called this to distinguish them from the "parallel" models (e.g. parallel random access machine) [cf. van Emde Boas (1990)].".
- Q3842021 wikiPageWikiLink Q1029256.
- Q3842021 wikiPageWikiLink Q1239172.
- Q3842021 wikiPageWikiLink Q1392740.
- Q3842021 wikiPageWikiLink Q1456811.
- Q3842021 wikiPageWikiLink Q15840190.
- Q3842021 wikiPageWikiLink Q163310.
- Q3842021 wikiPageWikiLink Q17455.
- Q3842021 wikiPageWikiLink Q17457.
- Q3842021 wikiPageWikiLink Q1754095.
- Q3842021 wikiPageWikiLink Q1812791.
- Q3842021 wikiPageWikiLink Q189088.
- Q3842021 wikiPageWikiLink Q189120.
- Q3842021 wikiPageWikiLink Q189376.
- Q3842021 wikiPageWikiLink Q190686.
- Q3842021 wikiPageWikiLink Q1930388.
- Q3842021 wikiPageWikiLink Q1961494.
- Q3842021 wikiPageWikiLink Q204815.
- Q3842021 wikiPageWikiLink Q2165944.
- Q3842021 wikiPageWikiLink Q2565212.
- Q3842021 wikiPageWikiLink Q2703890.
- Q3842021 wikiPageWikiLink Q2878974.
- Q3842021 wikiPageWikiLink Q330567.
- Q3842021 wikiPageWikiLink Q333464.
- Q3842021 wikiPageWikiLink Q335148.
- Q3842021 wikiPageWikiLink Q40056.
- Q3842021 wikiPageWikiLink Q420105.
- Q3842021 wikiPageWikiLink Q439245.
- Q3842021 wikiPageWikiLink Q453518.
- Q3842021 wikiPageWikiLink Q495298.
- Q3842021 wikiPageWikiLink Q595713.
- Q3842021 wikiPageWikiLink Q6251515.
- Q3842021 wikiPageWikiLink Q62870.
- Q3842021 wikiPageWikiLink Q62874.
- Q3842021 wikiPageWikiLink Q641044.
- Q3842021 wikiPageWikiLink Q68.
- Q3842021 wikiPageWikiLink Q707977.
- Q3842021 wikiPageWikiLink Q711833.
- Q3842021 wikiPageWikiLink Q7208369.
- Q3842021 wikiPageWikiLink Q7326846.
- Q3842021 wikiPageWikiLink Q78106.
- Q3842021 wikiPageWikiLink Q787114.
- Q3842021 wikiPageWikiLink Q8366.
- Q3842021 wikiPageWikiLink Q8646953.
- Q3842021 wikiPageWikiLink Q92794.
- Q3842021 wikiPageWikiLink Q92875.
- Q3842021 wikiPageWikiLink Q93005.
- Q3842021 comment "In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm development and algorithm complexity theory.The RASP is a random-access machine (RAM) model that, unlike the RAM, has its program in its "registers" together with its input. The registers are unbounded (infinite in capacity); whether the number of registers is finite is model-specific.".
- Q3842021 label "Random-access stored-program machine".