Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7208369> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- Q7208369 subject Q8646953.
- Q7208369 abstract "In theoretical computer science a pointer machine is an "atomistic" abstract computational machine model akin to the Random access machine.Depending on the type, a pointer machine may be called a linking automaton, a KU-machine, an SMM, an atomistic LISP machine, a tree-pointer machine, etc. (cf Ben-Amram 1995). At least three major varieties exist in the literature—the Kolmogorov-Uspenskii model (KUM, KU-machine), the Knuth linking automaton, and the Schönhage Storage Modification Machine model (SMM). The SMM seems to be the most common.From its "read-only tape" (or equivalent) a pointer machine receives input -- bounded symbol-sequences ("words") made of at least two symbols e.g. { 0, 1 } -- and it writes output symbol-sequences on an output "write-only" tape (or equivalent). To transform a symbol-sequence (input word) to an output symbol-sequence the machine is equipped with a "program" -- a finite-state machine (memory and list of instructions). Via its state machine the program reads the input symbols, operates on its storage structure -- a collection of "nodes" (registers) interconnected by "edges" (pointers labelled with the symbols e.g. { 0, 1 }), and writes symbols on the output tape.Pointer machines cannot do arithmetic. Computation proceeds only by reading input symbols, modifying and doing various tests on its storage structure—the pattern of nodes and pointers, and outputting symbols based on the tests. "Information" is in the storage structure.".
- Q7208369 wikiPageExternalLink 78.pdf.
- Q7208369 wikiPageWikiLink Q1137726.
- Q7208369 wikiPageWikiLink Q153224.
- Q7208369 wikiPageWikiLink Q15840190.
- Q7208369 wikiPageWikiLink Q163310.
- Q7208369 wikiPageWikiLink Q1812791.
- Q7208369 wikiPageWikiLink Q189088.
- Q7208369 wikiPageWikiLink Q1930388.
- Q7208369 wikiPageWikiLink Q230885.
- Q7208369 wikiPageWikiLink Q2565212.
- Q7208369 wikiPageWikiLink Q2574032.
- Q7208369 wikiPageWikiLink Q2703890.
- Q7208369 wikiPageWikiLink Q2878974.
- Q7208369 wikiPageWikiLink Q349647.
- Q7208369 wikiPageWikiLink Q3842021.
- Q7208369 wikiPageWikiLink Q787114.
- Q7208369 wikiPageWikiLink Q7879073.
- Q7208369 wikiPageWikiLink Q8061506.
- Q7208369 wikiPageWikiLink Q82438.
- Q7208369 wikiPageWikiLink Q8646953.
- Q7208369 comment "In theoretical computer science a pointer machine is an "atomistic" abstract computational machine model akin to the Random access machine.Depending on the type, a pointer machine may be called a linking automaton, a KU-machine, an SMM, an atomistic LISP machine, a tree-pointer machine, etc. (cf Ben-Amram 1995).".
- Q7208369 label "Pointer machine".