At the moment I am trying to decide which book to buy, there are many that I think would be very interesting, but some are most likely beyond me. The books in my list, along with my thoughts on them are: Concrete Mathematics (I believe this is probably too advanced for me at the moment, however I am revising mathematics and will want to pick this up in a few months) The art of computer programming volumes 1-4 (I have read many times that one should be familiar with the concepts in Concrete Mathematics before attempting to consume this book, … |
+0 forum
13 | ||

Hi, I am trying to add a background image in turing, can somebody so me how I would be able to do this? |
+0 forum
0 | ||

I tried to do this type of some good random exercise, but I was completely working on it for a month and totally felt unbelievable. I need to see the solution for this type of exercise in order to understand :(. I have hint like 'IF, ELSE, DO' statements, but the solution could help me really to understand completely about Turing Machine. Consider the alphabets {d, r} Write a Turing Machine that will recognise the language Stretch(x+1). This is the language of all strings that contain a continuous string of occurrences of the two letters, followed by ‘*’, followed by … |
+0 forum
12 | ||

Hi I'm am trying to prove that a partial function is only computable by a Unlimited Register Machine iff it is computable by a standard TM. How should approach this proof. Does it have anything to do with reductions? Thanks in advance |
+0 forum
1 | ||

Hello, I have been given the question : to create a turing machine that begins on a tape containing a single 1 and never halts but successively displayes the strings. ..b 1 b... ..b 0 1 0 b... ..b 0 0 1 0 0 b... where b stands for blank. This is the states I came up with : S0- starting state pointing to the single 1 S1- state scanning for the leftmost blank S2 - state that prints out /displays the 0 or 1 S3 - state that does not print blanks. The following are the tuples I came … |
+0 forum
0 |

The End.