# Published articles

> Published writing on computing education, data science, algorithms, pedagogy, and evidence.

- [When the scores are the same — Erkan Malcok](https://erkanmalcok.com/articles/when-the-scores-are-the-same/index.md): Similar scores can hide differences in reliability, effort and durability. How to evaluate what matters when headline results look alike.
- [Computer science has two parents — Erkan Malcok](https://erkanmalcok.com/articles/computer-science-has-two-parents/index.md): Computer science inherits abstraction from mathematics and practical constraint from engineering. To understand the subject, students need both.
- [Debugging as a teachable habit — Erkan Malcok](https://erkanmalcok.com/articles/debugging-as-a-teachable-habit/index.md): Debugging is not a remedial afterthought. This piece treats it as core computing thinking: reproduce, narrow, hypothesise, test, and learn from failure.
- [Fluent answers are not understanding — Erkan Malcok](https://erkanmalcok.com/articles/fluent-answers-are-not-understanding/index.md): Why fluent AI answers are weak evidence of understanding, and how teachers can distinguish polished work from learning in teaching and assessment.
- [LLM fluency is not reasoning — Erkan Malcok](https://erkanmalcok.com/articles/llm-fluency-is-not-reasoning/index.md): Explore the difference between fluent language and reasoning, and how to evaluate claims about what large language models understand and get right.
- [Measure before you optimise — Erkan Malcok](https://erkanmalcok.com/articles/measure-before-you-optimise/index.md): Dashboards and metrics are easy to collect and hard to interpret. This piece argues for measuring the right thing before improving what is merely visible.
- [Productive struggle in learning — Erkan Malcok](https://erkanmalcok.com/articles/productive-struggle-in-learning/index.md): When does difficulty help learning? Explore productive struggle, the risks of instant AI help, and ways to preserve the thinking learners need to do.
- [Recursion without mystery — Erkan Malcok](https://erkanmalcok.com/articles/recursion-without-mystery/index.md): Understand recursion through base cases, recursive steps and smaller subproblems, with Python examples that show how recursive calls fit together.
- [Teaching computing beyond syntax — Erkan Malcok](https://erkanmalcok.com/articles/teaching-computing-beyond-syntax/index.md): Pupils can write working code and still miss the idea. This piece argues for teaching computing as explanation, structure, and judgement — not only correct output.
- [Bellman–Ford Algorithm — Erkan Malcok](https://erkanmalcok.com/articles/bellman-ford-algorithm/index.md): A clear guide to the Bellman–Ford algorithm, including relaxation, negative edges, negative cycles, complexity, and a Python implementation.