Welcome! Log In Create A New Profile

2007 Q9

Posted by Rey

Announcements		Last Post
	SoC Curricula	09/30/2017 01:08PM
	Demarcation or scoping of examinations and assessment	02/13/2017 07:59AM
	School of Computing Short Learning Programmes	11/24/2014 08:37AM
	Unisa contact information	07/28/2011 01:28PM

Forums Messages New

Rey

2007 Q9
October 30, 2010 01:38PM

Registered: 18 years ago
Posts: 163
Rating: 0

Question 9 (2007)

a) A function is computable if there exist a Turing Machine that can accept it.

b) As it is accepted by the TM bellow it is computable
Correction please read post bellow by louisrdev. I agree.

Reply Quote

louisrdev

Re: 2007 Q9
October 30, 2010 01:56PM

Registered: 14 years ago
Posts: 20
Rating: 0

Hi

Am I missing something, where did you get the exam paper for 2007? Can you please send it to me.

my email is [louisrdev][at][gmail][dot][com]

Thanks

Reply Quote

louisrdev

Re: 2007 Q9
October 30, 2010 10:39PM

Registered: 14 years ago
Posts: 20
Rating: 0

Agreed, except I will move right after the last step, if n = 4 you will move left past the start of the tape and the machine will crash.