|
|
|
|
|
by NAFV_P
4337 days ago
|
|
> But -- to the refutation of your core argument -- it's definitely never insinuated in TG that the ideas don't exist independently of the programming. Such an insinuation, that geometry does not exist independently of a programming environment, is as absurd as the notion that algorithms can't be written without a machine. Was that my core argument? My original comment (as pointed out by the omnipresent DanBC) was poorly phrased, and was rephrased as: https://news.ycombinator.com/item?id=8126115 > If you can teach the student to think precisely and unambiguously about a single algorithm, the unrelenting logic of the machine is no stumbling block; quite the opposite, actually. Of course it isn't a stumbling block, logical thinking is required for both, which would also explain why they are both difficult. |
|
You can teach computer science without teaching coding. And you can write algorithms without testing them on a computer.
So the tautology that "you can't code if you can't code" isn't a particularly important pedagogical insight when it comes to teaching CS, since CS != coding.
> Of course it isn't a stumbling block, logical thinking is required for both, which would also explain why they are both difficult.
Right. And I'm saying that, in my experience teaching, it's better to teach CS and then let programming be something that kind of just falls out of that naturally, as opposed to focusing on programming itself.