Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5157272> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- Q5157272 subject Q8596994.
- Q5157272 abstract "In computer science, a computation history is a sequence of steps taken by an abstract machine in the process of computing its result. Computation histories are frequently used in proofs about the capabilities of certain machines, and particularly about the undecidability of various formal languages.Formally, a computation history is a (normally finite) sequence of configurations of a formal automaton. Each configuration fully describes the status of the machine at a particular point. To be valid, certain conditions must hold: the first configuration must be a valid initial configuration of the automaton and each transition between adjacent configurations must be valid according to the transition rules of the automaton.In addition, to be complete, a computation history must be finite and the final configuration must be a valid terminal configuration of the automaton.The definitions of "valid initial configuration", "valid transition", and "valid terminal configuration" vary for different kinds of formal machines.A deterministic automaton has exactly one computation history for a given initial configuration, though the history may be infinite and therefore incomplete.".
- Q5157272 wikiPageWikiLink Q11538.
- Q5157272 wikiPageWikiLink Q131133.
- Q5157272 wikiPageWikiLink Q163310.
- Q5157272 wikiPageWikiLink Q176452.
- Q5157272 wikiPageWikiLink Q192161.
- Q5157272 wikiPageWikiLink Q21198.
- Q5157272 wikiPageWikiLink Q272404.
- Q5157272 wikiPageWikiLink Q3502995.
- Q5157272 wikiPageWikiLink Q729271.
- Q5157272 wikiPageWikiLink Q751443.
- Q5157272 wikiPageWikiLink Q787114.
- Q5157272 wikiPageWikiLink Q787116.
- Q5157272 wikiPageWikiLink Q8596994.
- Q5157272 comment "In computer science, a computation history is a sequence of steps taken by an abstract machine in the process of computing its result. Computation histories are frequently used in proofs about the capabilities of certain machines, and particularly about the undecidability of various formal languages.Formally, a computation history is a (normally finite) sequence of configurations of a formal automaton. Each configuration fully describes the status of the machine at a particular point.".
- Q5157272 label "Computation history".