Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Turing_completeness> ?p ?o }
- Turing_completeness wikiPageWikiLink Regular_expression.
- Turing_completeness wikiPageWikiLink Regular_language.
- Turing_completeness wikiPageWikiLink Rewriting.
- Turing_completeness wikiPageWikiLink Rolf_Herken.
- Turing_completeness wikiPageWikiLink Rule_110.
- Turing_completeness wikiPageWikiLink S-expression.
- Turing_completeness wikiPageWikiLink SQL.
- Turing_completeness wikiPageWikiLink Simply_typed_lambda_calculus.
- Turing_completeness wikiPageWikiLink Smalltalk.
- Turing_completeness wikiPageWikiLink Smn_theorem.
- Turing_completeness wikiPageWikiLink Stephen_Wolfram.
- Turing_completeness wikiPageWikiLink Structured_program_theorem.
- Turing_completeness wikiPageWikiLink System_F.
- Turing_completeness wikiPageWikiLink Theoretical_computer_science.
- Turing_completeness wikiPageWikiLink Timeout_(computing).
- Turing_completeness wikiPageWikiLink Total_functional_programming.
- Turing_completeness wikiPageWikiLink Turing_machine.
- Turing_completeness wikiPageWikiLink Turing_tarpit.
- Turing_completeness wikiPageWikiLink Universal_Turing_machine.
- Turing_completeness wikiPageWikiLink Universe.
- Turing_completeness wikiPageWikiLink XML.
- Turing_completeness wikiPageWikiLink XSLT.
- Turing_completeness wikiPageWikiLink YAML.
- Turing_completeness wikiPageWikiLinkText "Turing complete".
- Turing_completeness wikiPageWikiLinkText "Turing completeness".
- Turing_completeness wikiPageWikiLinkText "Turing completeness#Video games".
- Turing_completeness wikiPageWikiLinkText "Turing equivalence".
- Turing_completeness wikiPageWikiLinkText "Turing equivalent".
- Turing_completeness wikiPageWikiLinkText "Turing powerful".
- Turing_completeness wikiPageWikiLinkText "Turing-complete".
- Turing_completeness wikiPageWikiLinkText "Turing-equivalent".
- Turing_completeness wikiPageWikiLinkText "Turing-universal".
- Turing_completeness wikiPageWikiLinkText "computationally universal".
- Turing_completeness wikiPageWikiLinkText "flexible nature".
- Turing_completeness wikiPageWikiLinkText "formally complete".
- Turing_completeness wikiPageWikiLinkText "non-Turing-complete programming language".
- Turing_completeness wikiPageWikiLinkText "running a software program".
- Turing_completeness wikiPageWikiLinkText "turing-complete".
- Turing_completeness wikiPageWikiLinkText "universal computation".
- Turing_completeness wikiPageWikiLinkText "universal model of computation".
- Turing_completeness wikiPageWikiLinkText "universal".
- Turing_completeness wikiPageUsesTemplate Template:Citation_needed.
- Turing_completeness wikiPageUsesTemplate Template:Cite_journal.
- Turing_completeness wikiPageUsesTemplate Template:Cite_news.
- Turing_completeness wikiPageUsesTemplate Template:Div_col.
- Turing_completeness wikiPageUsesTemplate Template:Div_col_end.
- Turing_completeness wikiPageUsesTemplate Template:For.
- Turing_completeness wikiPageUsesTemplate Template:Main.
- Turing_completeness wikiPageUsesTemplate Template:More_footnotes.
- Turing_completeness wikiPageUsesTemplate Template:Refbegin.
- Turing_completeness wikiPageUsesTemplate Template:Refend.
- Turing_completeness wikiPageUsesTemplate Template:Reflist.
- Turing_completeness wikiPageUsesTemplate Template:Snd.
- Turing_completeness wikiPageUsesTemplate Template:Unreliable_source%3F.
- Turing_completeness subject Category:Programming_language_theory.
- Turing_completeness subject Category:Theory_of_computation.
- Turing_completeness subject Category:Turing_machine.
- Turing_completeness type Area.
- Turing_completeness type Model.
- Turing_completeness type Area.
- Turing_completeness type Machine.
- Turing_completeness type Method.
- Turing_completeness type Model.
- Turing_completeness comment "In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any single-taped Turing machine. The concept is named after English mathematician Alan Turing.".
- Turing_completeness label "Turing completeness".
- Turing_completeness sameAs Q197970.
- Turing_completeness sameAs Turing_complet.
- Turing_completeness sameAs Turingovská_úplnost.
- Turing_completeness sameAs Turing-komplet.
- Turing_completeness sameAs Turing-Vollständigkeit.
- Turing_completeness sameAs Turing_completo.
- Turing_completeness sameAs کامل_بودن_تورینگ.
- Turing_completeness sameAs Turing-vahva.
- Turing_completeness sameAs Turing-complet.
- Turing_completeness sameAs Turing_complete.
- Turing_completeness sameAs Turing_equivalenza.
- Turing_completeness sameAs チューリング完全.
- Turing_completeness sameAs 튜링_완전.
- Turing_completeness sameAs Turingvolledigheid.
- Turing_completeness sameAs Kompletność_Turinga.
- Turing_completeness sameAs Turing_completude.
- Turing_completeness sameAs m.07jn9.
- Turing_completeness sameAs Полнота_по_Тьюрингу.
- Turing_completeness sameAs Turing_complete.
- Turing_completeness sameAs Тјурингова_потпуност.
- Turing_completeness sameAs Turingkomplett.
- Turing_completeness sameAs Повнота_за_Тюрингом.
- Turing_completeness sameAs Q197970.
- Turing_completeness sameAs 圖靈完備性.
- Turing_completeness wasDerivedFrom Turing_completeness?oldid=707513467.
- Turing_completeness isPrimaryTopicOf Turing_completeness.