Skip to search formSkip to main contentSkip to account menu

Turing completeness

Known as: Turing-complete device, Turing-complete language, Turing complete 
In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records that… 
Review
2004
Review
2004
Recommender systems have been evaluated in many, often incomparable, ways. In this article, we review the key decisions in… 
Review
2004
Review
2004
We describe a Bayesian approach for learning Bayesian networks from a combination of prior knowledge and statistical data. First… 
Highly Cited
2001
Highly Cited
2001
Monte Carlo methods are revolutionizing the on-line analysis of data in fields as diverse as financial modeling, target tracking… 
Highly Cited
1997
Highly Cited
1997
With more than 500 pages of new material, the Handbook of Parametric and Nonparametric Statistical Procedures, Fourth Edition… 
Highly Cited
1994
Highly Cited
1994
Part I. Introduction: Networks, Relations, and Structure: 1. Relations and networks in the social and behavioral sciences 2… 
Highly Cited
1992
Highly Cited
1992
Highly Cited
1980
Highly Cited
1980
  • R. Milner
  • Lecture Notes in Computer Science
  • 1980
  • Corpus ID: 27047741
0. Introduction.- 1. Experimenting on nondeterministic machines.- 2. Synchronization.- 3. A case study in synchronization and… 
Highly Cited
1962
Highly Cited
1962
The item-banked version of Raven's APM delivers a set of 23 matrices randomly selected from a recommend RAVEN'S Standard… 
Highly Cited
1951
Highly Cited
1951
AbstractA general formula (α) of which a special case is the Kuder-Richardson coefficient of equivalence is shown to be the mean…