38 citations · 65 across the 15 of their papers we have counts for
Showing 2009 · cs.CCShow all
2 papers · 2 filters
cs.CC2009★ 8 cited
Recombinations of Busy Beaver Machines
Norbert Bátfai
Many programmers belive that Turing-based machines cannot think. We also believe in this, however it is interesting to note that the most sophisticated machines are not programmed…
cs.CC2009★ 5 cited
On the Running Time of the Shortest Programs
Norbert Bátfai
The Kolmogorov complexity of the word w is equal to the length of the shortest concatenation of program Z and its input x with which the word w is computed by the universal turing…