The Universal Turing machine cardUniversal Turing machine

Universal Turing machine

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In computer science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, as described by Alan Turing in his seminal paper "On Computable Numbers, with an Application to the Entscheidungsproblem".

Excerpt from the Wikipedia article “Universal Turing machine”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Fschwarzentruber, CC BY-SA 4.0, via Wikimedia Commons.

Open free boosters and add Universal Turing machine to your collection.

Play for free

Related cards