computable number (3 Ergebnisse)

Zustand: Good. First edition copy. . Offprint of Journal of the Association for Computing Machinery, Vol. 15, no. 2, April 1968, pp. 275-299. (computer science, mathematics).

Grey Wrappers. Zustand: Very Good. First Edition. Volume 2 No 1, Containing Pp 1-64. Scarce In This, The Original Publication State Of Gray Printed Wrappers. Contains Two Articles, By Raphael M Robinson, H. B. Curry And A. Fraenkel, And 28 Pp Of Reviews Of Important Recent Works, Including Church's Reviews Of Turing's Important 1936 Work On Computability, And Post's Independent Related Work Proposing "A Definition Of 1-Finite 1-Process' Which Is Similar In Formulation, And In Fact Equivalent, To Computation By A Turing Machine. The Present Paper Was Written Independently Of Turing's, Which Was At The Time In Press But Had Not Yet Appeared." A Clean, Lightly Used Copy, But With A Dampstain Along The Foredge Starting With A Trace At A 1/8" X 1/2" Area At The Upper Edge Of P 13 And Becoming Progressively Larger Until It Is 1/2" X 9" Along The Edge Of The Rear Cover.

N.Y., 1962. Entire issue in wrappers. First publication of Rado's highly influential paper, in which he describes the Busy Beaver Game. The present paper - one of the most important results within theoretical computer science - deals with the existence of non computable functions. "The busy beaver game, originally posed by Rado in 1962, is a problem in which the challenge is to construct a Touring machine on a given number of states and symbols that prints a maximal number of ones, or alternatively executes a maximal number left/right shifts, and subsequently halts. Although the problem is simple to state and its solutions are finite and well-defined, determination of actual values are readily shown to be non-computable." (Teuscher, Proceedings of the 2005 Workshop on Unconventional Computing, p. 89.).