If you don't know who [Alan Turing](http://en.wikipedia.org/wiki/Alan_Turing) was, then shame on you. The British code breaker, mathematics genius and father of both computer science and artificial intelligence is rightly credited with helping to bring the second world war to an end. Turing was also gay, and that's where the shame has stuck firmly on the UK establishment for more than 60 years. Turing was convicted for 'homosexual activity' in 1952, and his punishment was to be chemically castrated. This shameful and appaling conviction meant that Turing was unable to continue his pioneering code-breaking work at Bletchley Park as he lost …

Member Avatar
Member Avatar
+8 forum 16

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, …

Member Avatar
Member Avatar
+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?

Member Avatar
+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 …

Member Avatar
Member Avatar
+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

Member Avatar
Member Avatar
+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 …

Member Avatar
+0 forum 0

Bletchley Park, the top secret code breaking hub that played a pivotal role in the outcome of World War Two, has finally been awarded development funding of some £460,500 ($735,500) from the Heritage Lottery Fund. The money will literally save the place the saved the lives of countless people by shortening World War two by at least two years. With the money, the Bletchley Park Trust will be able to start plans for transforming [URL="http://www.bletchleypark.org.uk"]Bletchley Park[/URL] itself into a world class heritage and educational centre. The Trust now has a further two years in which to finalise the plans before …

Member Avatar
+3 forum 0

The End.