Messages

The exam takes place in room Postscript (our regular room).

Exam Schedule for June 5th 2018:

• 12.00: (Candidate 15304) Jackson, Martin Mellum
• 12.45: (Candidate 15306) Kirupanithy, Nirujah
• 13.30: (Candidate 15313) Thapa, Ratan Bahadur
• (break)
• 14:45: (Candidate 15314) D?hlen, Ingrid
• 15:30: (Candidate 15316) R?yknes, Mikael Nielsen
• 16:15: (Candidate 15304) Scheffer, Lonneke

If you do not find your name on the list above and

1. is enrolled for the exam
2. plan to show up for exam

then you should be present outside room Postscript Tuesday the 5th of June 12:00. You will be assigned a time for your exam the 6th of June.

It turns out that 14 candidates are enrolled for the final exam. I strongly suspect that maximum five candidates intend to show up: Those five who have attended the last few lectures (Lonneke S., Mikael R., Martin M. J., Ingerid D., and the student that discussed the S-m-n Theorem with me after the last lecture).

These five candidates will be examined between 12:00 and 17:00 Tuesday the 5th. The exact schedule will be published at this website June 1 (after our final meeting). I assume that all five of you will show up at the final  meeting (those of you  who will not, should send me an e-mail).

If anyone else of the 14 enrolled students intend to meet for the final exam, they should meet outside room Postscript 12:00 June 5 (and get the exact time for their examination).

Please see

http://folk.uio.no/larsk/solutions-exabert.pdf

The final regular lecture will be May 22.

We will have a final problem class Friday 1st of June 12:15. We meet outside room Postscript. If Postscript is free, we will use the room, otherwise, we will find another room.

I have updated the exercises on computable analysis:

http://folk.uio.no/larsk/exaberth.pdf

I have also made written solutions to these exercises, but I will wait a little bit before I publish them.

I am nearly done lecturing Chapter 3 of Auberth's book. Next week I will start to lecture Chapter 5 (I will not say much about Chapter 4).

I have made some exercises for you, please see

   http://folk.uio.no/larsk/exaberth.pdf

You will need this book:

                               http://folk.uio.no/larsk/aberth.pdf

Beware that it might  take a really long time to download the book. You will need the first 46 pages of the book.

I am nearly done lecturing Chapter 7. Thus, the lectures on computable analysis will start next week.

Exercise 1, 2, 4, 5 and 6a (page 265-266). Exercise 6a is hard.

Exercise 1, 2, 3 and 5 (page 254-255).

Next week I will talk a little bit more on Hilbert's 10th Problem. Thereafter I will explain and prove Rice's Theorem.

A group of students will meet and discuss exercises:

Kollokvierom beta, 16-04-2018, 12:00 - 14:00.

You are all welcome to join the group.

I recomed theis Facebook group:

               https://www.facebook.com/groups/193518731259873/

I have lectured until Section 7.7.2.

Next week I will lecture Section 7.7.2 (G?del's First Incompleteness Theorem). I assume I need one hour to lecture that section. Then, I will start to lecture Section 7.8 (More on Undecidability).

There will be a problem class Monday the 9th of April 4:15pm in our regular room.

We will discuss the  assignment I handed out in class some weeks ago. We will also discuss some selected exercises from our textbook. Please inform me (by e-mail) if there are particular exercises you want me to comment on.

You should read

• Section 4.2 (pp. 105-108)
• Section 4.6 (pp. 113-115)
• Section 3.1 (pp. 73-74)
• Section 5.7 (pp. 139-142). This is a section on G?del numbers. G?del number are very similar to computable indices. I will explain the G?del numbers when we need them.

Maybe you need to read a little bit more in order to understand the notation you find on these pages, but if you have attended the lectures that should in principle not be necessary.

Next week (Tuesday 13) I will start to lecture Section 7.7 (but before that I will talk a little bit more on first-order logic and what you need to know from the first sixt chapters of our book).

There will be no lecture Tuesday the 20th of March! (and there will no lecture Tuesday the 27th of March because of the Easter holiday).

Thus, there will a long break (from March 13 until April 3).

The lectures will continue throughout May, and the exam will be in June.

I have handed out an assignment in class. If you were not there and want a copy of the assignment, please send med an e-mail.

The assignment is not mandatory, but you are welcome to hand in written solutions (and I will give my comments).

I am done lecturing Section 7.6.

Next week (March 6) I will give a lecture on first-order logic. I will give a summary of what you need to know of the six first chapters of our book. (I will do this since most of have not followed the course MAT-INF3600.)

If there is any time left, we will discuss some of the exercises.

I recommend exercise 1, 2, 3, 4, 5, 6, 7, 8 and 9 (pp. 243-245) form Section 7.6.

Exercise 10 and 11 are suitable for those who want to do more exercises than the 9 mentioned above.

I recommend  exercise 3, 4 and 5 (pp. 234-235).  These  are good (and quite hard) exercises that do not relate to the technical stuff in Section 7.5 (exercise 1 and 2 at page 234 are easy, but they require that you know the  know the technical stuff).

Exercise 6 (p. 235) is a hard exercise on the Ackermann function. It is an exercise for those who need an extra challenge.

I have started to lecture 7.6. Next week (Tuesday 27) I will lecture the proof of Theorem 7.6.5 thoroughly . I have not lectured Section 7.5. You should read the section, but do not worry to much if you cannot digest all the details.

I recommend exercise 1, 2, 3, 4, 6, 7, and 8 from Section 7.4.1 (side 223). Exercise 5, 9 and 10 are suitable for those who need an extra challenge  (exercise 9b is extremely hard).

I am nearly done with Section 7.4. I have lectured until Theorem 7.4.8 (Undecidability of the Halting Problem). Next week (February 20) I will lecture the S-m-n Theorem. Thereafter I will start to lecture Section 7.5.