Bruno Bauwens
Bruno Bauwens is a faculty member and visiting speaker at HSE University who works in algorithms and theoretical computer science.
About
Bruno Bauwens is a faculty member and visiting speaker at HSE University who works in algorithms and theoretical computer science. His Kolmogorov complexity lecture proves the halting problem undecidable and constructs Solomonoff's universal prior from a prefix-universal Turing machine.
Same subject, Algorithms & Theoretical CS
Connections
3Their places, courses, books and lectures.
