Sign inSign in

Bruno Bauwens is a faculty member and visiting speaker at HSE University who works in algorithms and theoretical computer science.

More

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.

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.

Connections

3

Their places, courses, books and lectures.