In my MSc courses the lecturer gives proofs of important theorems, while unimportant problems are given as homework. This is bad for me, because it makes me focus on actually figuring out not too important stuff. I think it works like this because the course instructors want to • make the student do at least something and • check whether the student has learned the course material.
Ideally I would like to study using interactive textbooks where everything is a problem to solve on my own. Such a textbook wouldn’t show an important theorem’s proof right away. Instead it would show me the theorem’s statement and ask me to prove it. There should be hints available and, obviously, I should be able to see the author’s proof when I want to see it.
Also, for textbooks about Turing machines, recursive functions, and stuff like that: having an interpreter of Turing machines would be very nice. (googling Turing machine interpreter and using whatever you find is a bad idea, because they all have different flavors)
I found this to vary by field. When I studied topology and combinatorics we proved all the big important things as homework. When I studied automata theory and measure theory, we did what your teacher is doing.
In my MSc courses the lecturer gives proofs of important theorems, while unimportant problems are given as homework. This is bad for me, because it makes me focus on actually figuring out not too important stuff. I think it works like this because the course instructors want to • make the student do at least something and • check whether the student has learned the course material.
Ideally I would like to study using interactive textbooks where everything is a problem to solve on my own. Such a textbook wouldn’t show an important theorem’s proof right away. Instead it would show me the theorem’s statement and ask me to prove it. There should be hints available and, obviously, I should be able to see the author’s proof when I want to see it.
Also, for textbooks about Turing machines, recursive functions, and stuff like that: having an interpreter of Turing machines would be very nice. (googling Turing machine interpreter and using whatever you find is a bad idea, because they all have different flavors)
I found this to vary by field. When I studied topology and combinatorics we proved all the big important things as homework. When I studied automata theory and measure theory, we did what your teacher is doing.