Martin kleene (5 risultati)

- Brossura
Da: medimops, Berlin, Germaniamedimops
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 2,85
EUR 10,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Condizione: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.

The Undecidable, Basic Papers On Undecidable Propositions, Unsolvable Problems And Computable Functions (Including) Five Papers From Godel, Including Godel's "On Undecidable Propositions Of Formal Mathematical Systems" Etc., With New Supplementary Material From Godel, And Turing's "On Computable Numbers." And "Systems Of Logic Based On Ordinals", Also New Supplementary Material From Kleene For His Two Papers
Martin Davis (Editor); Kurt Godel, Alonzo Church, Alan M. Turing, J. B. Rosser, Stephen C. Kleene, Emil Post; Signed Bookplate Of Hal Berghel
Lingua: Inglese
Editore: Raven Press, Hewlett Ny 1965
- Rilegato
- Prima edizione
Da: Arroyo Seco Books, Pasadena, Member IOBA, Pasadena, CA, U.S.A.Arroyo Seco Books, Pasadena, Member IOBA
Contatta il venditoreVenditore con 4 stelleMembro dell’associazione: IOBA
Condizione: Usato - Quasi ottimo
EUR 361,48
EUR 7,05 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Near Fine. Condizione sovraccoperta: Very Good. 1st Edition. 440 Pp. Blue Cloth, Gilt. First Or Early Printing, Book Is 3.2 Cm Thick (An Otherwise Identical Issue In Blue Cloth Is Also 3.2 Cm Thick, But A Later Reprint In Blue Cloth With A Different Typesetting Of Title Page And Completely Different Copyri…ght Page With Isbn And In An Unpriced And Different Dust Jacket Is 2.9 Cm Thick). Slight Usage; Book Near Fine, Dj Priced $9.75, Light Usage, A Few Short Closed Tears At Edges And Minute Losses At Corners. The Book Is An Anthology Of 17 Papers, Most Previously Published, But Including Previously Unpublished Lectures By Godel And An Unpublished Account By Post Of His Early Work, And With Supplementary Material Furnished By Godel And Keene. Signed Bookplate And Also The Name Stamp Of Hal Berghel, Professor Of Computer Science At The University Of Nevada, Las Vegas Where He Has Previously Served As Director Of Both The Schools Of Computer Science And Informatics, And As Associate Dean Of The College Of Engineering. He Created And Directed The First Cybersecurity Degree Programs (Bachelors, Masters And Phd) In Nevada In 2005. He Was The Founding Director Of The Identity Theft And Financial Fraud Research And Operations Center And Cybersecurity Research Center.

The Undecidable, Basic Papers On Undecidable Propositions, Unsolvable Problems And Computable Functions (Including) Five Papers From Godel, Including Godel's "On Undecidable Propositions Of Formal Mathematical Systems" Etc., With New Supplementary Material From Godel, And Turing's "On Computable Numbers." And "Systems Of Logic Based On Ordinals", Also New Supplementary Material From Kleene For His Two Papers
Martin Davis (Editor); Kurt Godel, Alonzo Church, Alan M. Turing, J. B. Rosser, Stephen C. Kleene, Emil Post; Signed Bookplate Of Hal Berghel
Lingua: Inglese
Editore: Raven Press, Hewlett Ny 1965
- Rilegato
- Prima edizione
Da: Arroyo Seco Books, Pasadena, Member IOBA, Pasadena, CA, U.S.A.Arroyo Seco Books, Pasadena, Member IOBA
Contatta il venditoreVenditore con 4 stelleMembro dell’associazione: IOBA
Condizione: Usato - Quasi ottimo
EUR 539,87
EUR 7,05 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Near Fine. No Jacket. 1st Edition. 440 Pp. Red Cloth, Gilt. First Or Early Printing, Book Is 3.2 Cm Thick (An Otherwise Identical Issue In Blue Cloth Is Also 3.2 Cm Thick, But A Later Reprint In Blue Cloth With A Different Typesetting Of Title Page And Completely Different Copyright Page With Isbn And In A…n Unpriced And Different Dust Jacket Is 2.9 Cm Thick). Slight Usage; Book Near Fine, Bumping To Lower Front Tip, No Dut Jacket, No Marks. The Book Is An Anthology Of 17 Papers, Most Previously Published, But Including Previously Unpublished Lectures By Godel And An Unpublished Account By Post Of His Early Work, And With Supplementary Material Furnished By Godel And Keene.

- Brossura
- Prima edizione
Da: Schürmann und Kiewning GbR, Naumburg, GermaniaSchürmann und Kiewning GbR
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Ottimo
EUR 7,95
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
kart. Condizione: Sehr gut. 1. Aufl. [156] S. : Ill., graph. Darst., Kt. ; 19 cm Sprache: Deutsch Gewicht in Gramm: 238.

- Brossura
- Firmato
Da: Jeremy Norman's historyofscience, Novato, CA, U.S.A.Jeremy Norman's historyofscience
Contatta il venditoreVenditore con 2 stelleCondizione: Usato
EUR 4082,21
EUR 8,81 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Kleene, Stephen C. (1909-94); Martin Davis (1928-2023). (1) Group of 16 letters, including 8 typed letters signed and two autograph letters signed, pertaining to Kleene's 1981 paper, "Origins of recursive function theory," and Davis's 1982 paper, "Why Gödel didn't have Church's thesis"; see calendar of letters below. 26 sheets t…otal. October 1981 - 19 February 1982. Very good. (2) Kleene. Origins of recursive function theory. Offprint from Annals of the History of Computing 3 (1981). 52-67pp. 282 x 213 mm. Original plain wrappers. Very good. With 4 corrections in Kleene's hand. "Kleene, along with Rózsa Peter, Alan Turing, Emil Post and others, is best known as a founder of the branch of mathematical logic known as recursion theory, which subsequently helped to provide the foundations of theoretical computer science. Kleene's work grounds the study of computable functions. A number of mathematical concepts are named after him: Kleene hierarchy, Kleene algebra, the Kleene star (Kleene closure), Kleene's recursion theorem and the Kleene fixed-point theorem. He also invented regular expressions in 1951 to describe McCulloch-Pitts neural networks, and made significant contributions to the foundations of mathematical intuitionism" (Wikipedia article on Kleene). We are offering a collection of correspondence between Kleene and Martin Davis, a mathematician and logician who made important contributions to computability theory. Davis's work on Hilbert's tenth problem-asking for a general algorithm to decide the solvability of Diophantine equations-led to the Matiyasevich-Robinson-Davis-Putman (MRDP) theorem implying that a solution to this problem is impossible. Both Kleene and Davis had studied under Alonzo Church at Princeton, Kleene in the 1930s and Davis in the 1940s. The correspondence offered here, consisting of 16 letters (see the calendar below), centers on Davis's paper, "Why Gödel didn't have Church's thesis" (Information and Control 54 [1982]: 3-24), which had been inspired by Kleene's 1979 lecture on "Origins of recursive function theory" given in San Juan, Puerto Rico in 1979 at the 20th annual IEEE Symposium on Foundations of Computer Science. In his letter of 11/14/79 (letter 1), Kleene proposed an addition to the published version of his lecture (Annals of the History of Computing 3 [1981]: 52-67), based on a suggestion by Davis: "What would you think of adding the following to the second full paragraph of the of the right column of page 378: In a conversation at San Juan on October 31, 1979, Davis . . . expressed to me the opinion that my proof of the equivalence of my definition of general recursiveness to Gödel's (which Gödel called 'not quite trivial'), and my normal form theorem, were considerations which combined with Turing's arguments to convince Gödel of the Church-Turing thesis . . ." Sometime in 1981 Davis sent Kleene a preliminary version of "Why Gödel didn't have Church's thesis"-a paper "directly stimulated by your San Juan lecture"-which outlined the development of -definability and recursive function theory by Gödel, Church, Turing, Kleene, Post and others in the 1930s. Davis asked for Kleene's comments and corrections to the paper (letter 2); Kleene ended up sending Davis two long letters (letters 4 and 9) with extensive criticisms and additions, clarifying the chronology and priority of discovery, and adding important historical detail, particularly with regard to Church and Gödel. An example: "Just how far back Church's expressed speculations [re -definability] went I don't definitely recall. But his definite proposal was after his speaking out on the significance of -definability as a number-theoretic notion in the fall of 1933 . . . Then one day in his office in Fine Hall he made the definite proposal. This had to be after December 1933 since I was away from Princeton from early September 1933 till sometime in January or February 1934 . . . And Church, who is very careful, in his letter of November.