EUR 8,30
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCloth. Condizione: Very Good. 212 pp. Tightly bound. Corners not bumped. Text is Free of Markings. No ownership markings.
Da: Antiquariat Bookfarm, Löbnitz, Germania
EUR 8,29
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 03 MAC 9780817634391 Sprache: Englisch Gewicht in Gramm: 550.
Da: Antiquariat Bookfarm, Löbnitz, Germania
EUR 8,34
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 03 MAC 9780817634391 Sprache: Englisch Gewicht in Gramm: 550.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 51,63
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Best Price, Torrance, CA, U.S.A.
EUR 48,00
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloCondizione: New. SUPER FAST SHIPPING.
Da: Best Price, Torrance, CA, U.S.A.
EUR 48,00
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: New. SUPER FAST SHIPPING.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 57,95
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 59,94
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 56,38
Convertire valutaQuantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
EUR 74,55
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 228.
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
EUR 85,98
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
EUR 48,37
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: ALLBOOKS1, Direk, SA, Australia
EUR 108,31
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
EUR 64,08
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 97,90
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. Like New. book.
Editore: Birkhauser Boston Nov 1989, 1989
ISBN 10: 0817634398 ISBN 13: 9780817634391
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 86,02
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware - A mathematically precise definition of the intuitive notion of 'algorithm' was implicit in Kurt Godel's [1931] paper on formally undecidable propo sitions of arithmetic. During the 1930s, in the work of such mathemati cians as Alonzo Church, Stephen Kleene, Barkley Rosser and Alfred Tarski, Godel's idea evolved into the concept of a recursive function. Church pro posed the thesis, generally accepted today, that an effective algorithm is the same thing as a procedure whose output is a recursive function of the input (suitably coded as an integer). With these concepts, it became possible to prove that many familiar theories are undecidable (or non-recursive)-i. e. , that there does not exist an effective algorithm (recursive function) which would allow one to determine which sentences belong to the theory. It was clear from the beginning that any theory with a rich enough mathematical content must be undecidable. On the other hand, some theories with a substantial content are decidable. Examples of such decidabLe theories are the theory of Boolean algebras (Tarski [1949]), the theory of Abelian groups (Szmiele~ [1955]), and the theories of elementary arithmetic and geometry (Tarski [1951]' but Tarski discovered these results around 1930). The de termination of precise lines of division between the classes of decidable and undecidable theories became an important goal of research in this area. algebra we mean simply any structure (A, h(i E I)} consisting of By an a nonvoid set A and a system of finitary operations Ii over A.
Condizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.
Editore: Birkhäuser, Birkhäuser Okt 2011, 2011
ISBN 10: 1461289084 ISBN 13: 9781461289081
Lingua: Inglese
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A mathematically precise definition of the intuitive notion of 'algorithm' was implicit in Kurt Godel's [1931] paper on formally undecidable propo sitions of arithmetic. During the 1930s, in the work of such mathemati cians as Alonzo Church, Stephen Kleene, Barkley Rosser and Alfred Tarski, Godel's idea evolved into the concept of a recursive function. Church pro posed the thesis, generally accepted today, that an effective algorithm is the same thing as a procedure whose output is a recursive function of the input (suitably coded as an integer). With these concepts, it became possible to prove that many familiar theories are undecidable (or non-recursive)-i. e. , that there does not exist an effective algorithm (recursive function) which would allow one to determine which sentences belong to the theory. It was clear from the beginning that any theory with a rich enough mathematical content must be undecidable. On the other hand, some theories with a substantial content are decidable. Examples of such decidabLe theories are the theory of Boolean algebras (Tarski [1949]), the theory of Abelian groups (Szmiele~ [1955]), and the theories of elementary arithmetic and geometry (Tarski [1951]' but Tarski discovered these results around 1930). The de termination of precise lines of division between the classes of decidable and undecidable theories became an important goal of research in this area. algebra we mean simply any structure (A, h(i E I)} consisting of By an a nonvoid set A and a system of finitary operations Ii over A. 228 pp. Englisch.
Editore: Springer-Verlag New York Inc., 2011
ISBN 10: 1461289084 ISBN 13: 9781461289081
Lingua: Inglese
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 67,11
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 339.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 67,11
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 529.
Da: Majestic Books, Hounslow, Regno Unito
EUR 76,35
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 228 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 79,45
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 228.