Hi, I'm currently studying for an exam which includes turing machines used

to compute fucntions. I can understand how I can derive a turing machine

for certain functions but other questions are baffling me. I would

appreciate some on the following from past exam papers. Thanks. I have made

attempts at these questions so it you would like me to show you how far I've

got, please ask.

Build turing machines that compute the following functions..

1: f(n) = 2(n) where n is positive

2: x / 2, where x>= 2, and x is an even fucntion

3: f(x) = x div 2 (i.e. x divided by 2, rounded down)

4: f(n) = { 0, if n = 2,

{ n, otherwise

1. 2 dimensional (planar) Turing Machine v/s 1 dimensional Turing Machine

2. 2 dimensional Turing machine can solve Halting problem of a 1 dimensional turing machine

3. Turing was Wrong (was: C++ Simulator of a Universal Turing Machine)

4. Exploiting limitations of Turing machines in Turing tests?

5. Turing machine simulator, "Turing's World"

6. Simulating Turing Machines, Register Machines and Mobile Automata

7. 2 Dimensional (planar) Tuning Machine v/s 1 dimensional Turing machine

8. how to simulate a Turing Machine on a Post Machine ??

9. Question: Petri nets, Turing machines and registers machines

12. Intuitionist Objections to Turing's Paper (was Church-Turing compared to Zuse-Fredkin thesis)

13. Reminder, Turing Test Symposium & Turing Tests

1 post • Page:**1** of **1**