2000 character limit reached
A Busy Beaver Problem for Infinite-Time Turing Machines (1401.2187v1)
Published 9 Jan 2014 in math.LO, cs.CC, and cs.LO
Abstract: 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 the growth rate of an associated function. In our view, these results indicate that the generalization is both natural and promising.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.