|Abstract||Let ϕ be a fixed numerical function. If the k-state Turing machine M with input string ϕ(k) (that is, started in its initial state scanning the leftmost 1 of a single string of ϕ(k) 1s on an otherwise blank tape) produces the output string m (that is, halts in its halting state scanning the leftmost 1 of a single string of m 1s on an otherwise blank tape), we shall say that the ϕ-fecundity of M is m. If M halts in any other position or state, or fails to halt, its ϕ-fecundity is 0.|
|Keywords||No keywords specified (fix it)|
|Categories||No categories specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Nachum Dershowitz & Yuri Gurevich (2008). A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14 (3):299-350.
Jack Copeland (1998). Super Turing-Machines. Complexity 4 (1):30-32.
Arnold Oberschelp (1991). Review: Allen H. Brady, The Busy Beaver Game and the Meaning of Life. [REVIEW] Journal of Symbolic Logic 56 (3):1091-1091.
Robert P. Daley (1981). Busy Beaver Sets and the Degrees of Unsolvability. Journal of Symbolic Logic 46 (3):460-474.
Robert Weingard (1988). A Philosopher Looks at String Theory. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:95 - 106.
William Egginton (2007). The Philosopher's Desire: Psychoanalysis, Interpretation, and Truth. Stanford University Press.
Ralph McKenzie (2000). Recursive Inseparability for Residual Bounds of Finite Algebras. Journal of Symbolic Logic 65 (4):1863-1880.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #274,602 of 549,007 )
Recent downloads (6 months)0
How can I increase my downloads?