منابع مشابه
Busy beavers gone wild
When considering a class of Turing machines that halt when started from a blank tape, busy beavers for that class, as coined by Tibor Radó, are those Turing machines which eventually halt after the maximum number of steps (or after producing the maximum number of non-blank symbols). Finding for a class of Turing machines the busy beaver champion (for any of the two competitions) is of course un...
متن کاملThe Quest for Busy Beavers
In this chapter we study the feasibility of using Turing Machines as a model for the evolution of computer programs. To assess this idea we select, as test problem, the Busy Beaver — a well-known theoretical problem of undisputed interest and difficulty proposed by Tibor Rado in 1962. We focus our research on representational issues and on the development of specific genetic operators, proposin...
متن کاملBusy Beavers and Kolmogorov Complexity
The idea to find the “maximal number that can be named” can be traced back to Archimedes (see his Psammit [1]). From the viewpoint of computation theory the natural question is “which number can be described by at most n bits”? This question led to the definition of the so-called “busy beaver” numbers (introduced by T. Rado). In this note we consider different versions of the busy beaver-like n...
متن کاملSpatial and Energy Requirements of Beavers
The relationship between energy intake and metabolic requirements of beavers {Castor canadensis) is discussed in regard to the spatial requirements of three colonies. A 26pound yearling beaver requires 850 kcal of digestible energy, or 1.5 lb of fresh aspen per day, to maintain its daily metabolic processes with no additional growth. In order for such a beaver to attain maximum growth, 2040 kca...
متن کاملMarking time
Next, we discuss the point-based and interval-based versions of time. These were studied in Johan van Benthem’s book The logic of time and in several papers appearing around the same time: Vilain [1982], and Allen [1983], developed an interval algebra; Moszkowski and Manna [1983], as well as Schwartz, Melliar-Smith and Vogt [1983], advocated interval-based reasoning for hardware. The prohibitiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Theriologica
سال: 1970
ISSN: 0001-7051,2190-3743
DOI: 10.4098/at.arch.70-36