Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Richard E. Stearns and Turing machine

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Richard E. Stearns and Turing machine

Richard E. Stearns vs. Turing machine

Richard Edwin Stearns (born July 5, 1936) is a prominent computer scientist who, with Juris Hartmanis, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory" (Hartmanis and Stearns, 1965). A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules.

Similarities between Richard E. Stearns and Turing machine

Richard E. Stearns and Turing machine have 1 thing in common (in Unionpedia): Computational complexity theory.

Computational complexity theory

Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.

Computational complexity theory and Richard E. Stearns · Computational complexity theory and Turing machine · See more »

The list above answers the following questions

Richard E. Stearns and Turing machine Comparison

Richard E. Stearns has 19 relations, while Turing machine has 151. As they have in common 1, the Jaccard index is 0.59% = 1 / (19 + 151).

References

This article shows the relationship between Richard E. Stearns and Turing machine. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »