Nota: A tradução desta entrada está atualmente em revisão de qualidade, portanto parte do conteúdo é exibida temporariamente apenas em inglês.
Este verbete ainda não foi traduzido para o seu idioma, portanto o original é exibido abaixo.
Turing machine
This term refers to a theoretical construct rather than a physical piece of hardware. It is used primarily in computer science and mathematical logic to explore the boundaries of computability and the nature of algorithms. When discussing a Turing machine, the focus is on the logical process of symbol manipulation rather than electronic circuitry.
In academic and technical discourse, the term is often used to establish whether a problem is "decidable." If a problem cannot be solved by a Turing machine, it is considered non-computable, making this concept the gold standard for defining the absolute limits of any possible computing device.
Meanings
A mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules, used to define the limits of what can be computed.
The concept of the Turing machine provided the theoretical foundation for modern computer architecture.
Examples
The professor explained how a turing machine operates using a theoretical infinite tape.
I wonder if a turing machine could ever truly simulate human consciousness.
Alan Turing conceptualized the turing machine to explore the limits of computability.
Alan Turing conceptualized the turing machine to explore the limits of computability.
Is this problem solvable by a universal turing machine?
The course covers the fundamental relationship between a turing machine and modern computers.
The course covers the fundamental relationship between a turing machine and modern computers.
A turing machine reads and writes symbols on a tape based on a set of transition rules.
He spent the entire afternoon trying to map the algorithm to a turing machine.
The halting problem proves that there are things a turing machine cannot decide.