1 paper · 1 filter
James T. Long, Lee J. Stanley
This note introduces a generalization to the setting of infinite-time computation of the busy beaver problem from classical computability theory, and proves some results concerning…