Computer Science

2020-04-02 - The domain independence of asymptotic analysis
2020-02-05 - Depth vs Breadth First Search in practice
2019-11-06 - Meta programming languages debunked
2019-08-05 - Why Turing Machines rock
2019-03-27 - The universal algorithm and the Busy Beaver problem
2019-03-05 - Hamiltonian Cycle hardness and gadgets
2019-02-27 - Pseudo-polynomial computational complexity
2019-02-25 - The ever common Knapsack problem
2018-12-03 - Fun with self-referential paradoxes and the halting problem
2018-07-16 - About Lisp and programming languages
2018-05-30 - Kultur und Informatik 2018
2018-03-21 - Space vs Time
2018-03-18 - Subset Sum problem NP-hardness proof
2018-03-14 - On Computational Complexity
2018-03-11 - About Computability and Turing Machines

Questions, comments? Connect.