Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Computation_history> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Computation_history 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.".
- Computation_history wikiPageID "7620568".
- Computation_history wikiPageLength "7189".
- Computation_history wikiPageOutDegree "14".
- Computation_history wikiPageRevisionID "623893619".
- Computation_history wikiPageWikiLink Abstract_machine.
- Computation_history wikiPageWikiLink Automaton.
- Computation_history wikiPageWikiLink Category:Theory_of_computation.
- Computation_history wikiPageWikiLink Computer_science.
- Computation_history wikiPageWikiLink Context-free_language.
- Computation_history wikiPageWikiLink Determinism.
- Computation_history wikiPageWikiLink Deterministic.
- Computation_history wikiPageWikiLink Finite-state_machine.
- Computation_history wikiPageWikiLink Finite_set.
- Computation_history wikiPageWikiLink Finite_state_machine.
- Computation_history wikiPageWikiLink Formal_language.
- Computation_history wikiPageWikiLink Formal_languages.
- Computation_history wikiPageWikiLink Mathematical_proof.
- Computation_history wikiPageWikiLink Pushdown_automata.
- Computation_history wikiPageWikiLink Pushdown_automaton.
- Computation_history wikiPageWikiLink Turing_machine.
- Computation_history wikiPageWikiLink Turing_machines.
- Computation_history wikiPageWikiLink Undecidable_problem.
- Computation_history wikiPageWikiLinkText "computation history".
- Computation_history hasPhotoCollection Computation_history.
- Computation_history wikiPageUsesTemplate Template:Reflist.
- Computation_history subject Category:Theory_of_computation.
- Computation_history hypernym Sequence.
- Computation_history type Area.
- Computation_history type Area.
- Computation_history 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.".
- Computation_history label "Computation history".
- Computation_history sameAs Histórico_de_computação.
- Computation_history sameAs m.0266zgq.
- Computation_history sameAs Q5157272.
- Computation_history sameAs Q5157272.
- Computation_history wasDerivedFrom Computation_history?oldid=623893619.
- Computation_history isPrimaryTopicOf Computation_history.