Programming Binary Addition with a Turing Machine

Click For Summary
SUMMARY

This discussion centers on programming binary addition using a standard Turing machine, specifically focusing on adding two binary numbers modulo two with a single tape and read/write head. Participants express curiosity about the pedagogical value of such a program and its relevance to quantum mechanics. The distinction between standard and universal Turing machines is clarified, with emphasis on the standard model for this task. Resources related to Turing machines are shared to aid understanding.

PREREQUISITES
  • Understanding of Turing machine concepts
  • Basic knowledge of binary arithmetic
  • Familiarity with quantum computation principles
  • Ability to interpret mathematical resources on Turing machines
NEXT STEPS
  • Research how to implement binary addition using a standard Turing machine
  • Explore the differences between standard and universal Turing machines
  • Study the implications of Turing machines in quantum computation
  • Examine resources on Turing machine programming techniques
USEFUL FOR

Students and educators in computer science, particularly those interested in Turing machines and their applications in quantum computation, as well as anyone looking to deepen their understanding of binary arithmetic in theoretical computing contexts.

theophyman
Messages
17
Reaction score
0
hello,
One can wonder what is the relation between the title of this thread and the subject of quantum mechanics,
well, i was reading in a book about quantum computation and information and it was talking about computer science in some chapter where it shows a basic understanding of Turing machine.
Ok, my question is: how to write a program that adds (modulo two) two binary numbers (assuming that they have the same length) separated by a 'blank' . the turing machine has only one tape and one read/write head.

is it possible?

thank you
 
Physics news on Phys.org
There are many equivalent definition of what a universal Turing machine is, it could have just one tape, or several. In fact, anything a computer can do, a Turing machine can do as well. The rule of the game is to start from something as rudimentary as possible and progressively build up complexity. Quite frankly, I believe writing such a program is more of a curiosity, possibly with pedagogical value, but again : how is this relevant to quantum mechanics ?
 
humanino said:
There are many equivalent definition of what a universal Turing machine is, it could have just one tape, or several.

i am new in learning Turing machines, but i think there is a difference between "standard" turing machine and universal turing machine. my question is about the "standard" one.


humanino said:
I believe writing such a program is more of a curiosity, possibly with pedagogical value, but again : how is this relevant to quantum mechanics ?

i can get the answer of my question using one tape with tow heads (is it acceptable?).

humanino said:
how is this relevant to quantum mechanics ?

as i said in my question above, i am learning quantum computation and quantum information,i found the turing machine and universal turing machine in a book about the subject of quantum computation and information.
 
Found this for ya. Hope it helps your understanding.

http://www.maths.leeds.ac.uk/~awmorp/turingmachine/turing.html
 
Last edited by a moderator:
mikestampone said:
Found this for ya. Hope it helps your understanding.

http://www.maths.leeds.ac.uk/~awmorp/turingmachine/turing.html

thank you, it was very helpful.
 
Last edited by a moderator:

Similar threads

  • · Replies 25 ·
Replies
25
Views
4K
Replies
29
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K