@prefix rdf:	<http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix dbpedia:	<http://dbpedia.org/resource/> .
@prefix ns2:	<http://dbpedia.org/class/yago/> .
dbpedia:Pointer_machine	rdf:type	ns2:ComputationalModels .
@prefix owl:	<http://www.w3.org/2002/07/owl#> .
dbpedia:Pointer_machine	owl:sameAs	<http://rdf.freebase.com/ns/guid.9202a8c04000641f8000000000dc3bab> .
@prefix foaf:	<http://xmlns.com/foaf/0.1/> .
@prefix ns5:	<http://en.wikipedia.org/wiki/> .
dbpedia:Pointer_machine	foaf:page	ns5:Pointer_machine .
@prefix rdfs:	<http://www.w3.org/2000/01/rdf-schema#> .
dbpedia:Pointer_machine	rdfs:label	"Pointer machine"@en .
@prefix dbpprop:	<http://dbpedia.org/property/> .
dbpedia:Pointer_machine	dbpprop: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\u00F6nhage 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."@en ;
	rdfs: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)."@en .
@prefix skos:	<http://www.w3.org/2004/02/skos/core#> .
@prefix ns9:	<http://dbpedia.org/resource/Category:> .
dbpedia:Pointer_machine	skos:subject	ns9:Register_machines .
@prefix ns10:	<http://dbpedia.org/resource/Template:> .
dbpedia:Pointer_machine	dbpprop:wikiPageUsesTemplate	ns10:for ;
	dbpprop:forProperty	dbpedia:Data_structure ,
		dbpedia:Computer_program ,
		"pointer algorithm"@en .
@prefix ns11:	<http://www4.wiwiss.fu-berlin.de/flickrwrappr/photos/> .
dbpedia:Pointer_machine	dbpprop:hasPhotoCollection	ns11:Pointer_machine .
@prefix yago:	<http://mpii.de/yago/resource/> .
yago:Pointer_machine	owl:sameAs	dbpedia:Pointer_machine .