Turing machine(redirected from K-string Turing machine with input and output)
Also found in: Thesaurus, Encyclopedia.
A hypothetical computing device capable of storing information and responding to computational questions, used in mathematical studies of computability.
[After Alan Mathison Turingwho conceived such a machine.]
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.
(Computer Science) a hypothetical universal computing machine able to modify its original instructions by reading, erasing, or writing a new symbol on a moving tape of fixed length that acts as its program. The concept was instrumental in the early development of computer systems
Collins English Dictionary – Complete and Unabridged, 12th Edition 2014 © HarperCollins Publishers 1991, 1994, 1998, 2000, 2003, 2006, 2007, 2009, 2011, 2014
Tu′ring machine`(ˈtʊər ɪŋ, ˈtyʊər-)
a hypothetical computing device used in mathematical studies of the computability of numbers and in theories of automata.
[after Alan M. Turing (1912–54), English mathematician, who described such a machine in 1936]
Random House Kernerman Webster's College Dictionary, © 2010 K Dictionaries Ltd. Copyright 2005, 1997, 1991 by Random House, Inc. All rights reserved.
Switch to new thesaurus
|Noun||1.||Turing machine - a hypothetical computer with an infinitely long memory tape|
Based on WordNet 3.0, Farlex clipart collection. © 2003-2012 Princeton University, Farlex Inc.