Due Thursday, January 11 at 1:00 pm.
Advertisements
Due Thursday, January 11 at 1:00 pm.
This entry was posted on Thursday, January 4th, 2007 at 3:16 pm and is filed under 117b: Computability theory. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.
I would strongly request that you post PDF versions of the homework. This is pretty much unreadable as-is. I think WordPress has an attachment feature.
Sure, I wanted to test how this would look using just HTML code. Either a pdf or a LaTeX version (using LaTeX2HotEqN) will be posted tomorrow.
Sweet, thanks :). Looking forward to this course!
pdf file is now available. Let me know if there is any problems with it or with the homework in general.
In the future, if possible, could you also post the tex file? Thanks.
This first problem is absurd—after you walk through the hint, there’s practically nothing left to prove. Maybe the second problem will make up for it…
I think this Homework was actually quite easy. But that’s ok, the whole point was to make you guys comfortable with the notation. If you want to try something a bit more challenging, try to solve problem 1 *uniformly*, i.e., making e independent of f. It is still not too hard, but I don’t think the stated version of the enumeration theorem suffices for it.
The new homework set is more interesting, I promise.
In the second problem, I think you mean $phi_{e}(n)$ not $phi_{h(e)}(n)$.
Oh never mind I’m just used to Kechris’s notation.