Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
Chemistry
Biology and Medical
Earth Sciences
Computer Science
Computing and Technology
DIY Projects
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
Chemistry
Biology and Medical
Earth Sciences
Computer Science
Computing and Technology
DIY Projects
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Other Sciences
Programming and Computer Science
Is this a Turing-complete machine?
Reply to thread
Message
[QUOTE="QuantumQuest, post: 6025890, member: 554291"] As you're talking about a Turing - complete machine, you mean simulating a Turing machine using e,g. a programming language. Now, a Turing - complete programming language (or system in general) has to be able to give the ability to create and run any program that a Turing machine can run, given enough time and memory. Now, in the rules you define for the TM, I see a finite set of states, an input alphabet, a tape alphabet, a transition function - all these implied, but you also need a start state, a blank symbol and a set of final states. There are various programming tricks for a TM in order to simulate a real computer, like [I]multiple tracks[/I]: if you think of tape symbols as vectors with ##m## components and each component taking values from a finite alphabet, this makes the tape appear like having ##m## tracks, [I]marking: [/I]you use an extra track in order to mark certain positions, [I]state caching[/I]: you can also make state a vector construction with first component being the [I]control state. [/I]Also, as [I]willem2 [/I]points out, you can simulate a multi-tape Turing machine which will be harder but way faster. [/QUOTE]
Insert quotes…
Post reply
Forums
Other Sciences
Programming and Computer Science
Is this a Turing-complete machine?
Back
Top