How do you prove that f is computable?
http://tau-cm2012.wikidot.com/forum/t-470069/how-do-you-prove-that-f-is-computable
Posts in the discussion thread "How do you prove that f is computable?"Tue, 29 Sep 2020 14:32:16 +0000http://tau-cm2012.wikidot.com/forum/t-470069#post-1459762(no title)
http://tau-cm2012.wikidot.com/forum/t-470069/how-do-you-prove-that-f-is-computable#post-1459762
Fri, 25 May 2012 12:11:06 +0000Netanel
When we say that f is computable - can it be partially computable? Or must it be totally computable?

Thank you!

]]>
http://tau-cm2012.wikidot.com/forum/t-470069#post-1456321Re: How do you prove that f is computable?
http://tau-cm2012.wikidot.com/forum/t-470069/how-do-you-prove-that-f-is-computable#post-1456321
Tue, 22 May 2012 15:52:40 +0000marianos716120
You should convince that it may be implemented by a TM - by using as building blocks computations that were shown to be implementable by a TM (e.g. in recitation) or by detailing the way it may be implemented.
]]>
http://tau-cm2012.wikidot.com/forum/t-470069#post-1456023How do you prove that f is computable?
http://tau-cm2012.wikidot.com/forum/t-470069/how-do-you-prove-that-f-is-computable#post-1456023
Tue, 22 May 2012 07:40:24 +0000Nir
Hi,

How do I prove that f is computable? what is enough to show after describing the reduction and how it works?