Hardcover. Condition: Very Good. No Jacket. Missing dust jacket; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Hardcover. Condition: Near Fine. Dust Jacket Condition: Near Fine. 2nd Edition. Near Fine hardcover copy in publisher's illustrated boards. Mild rubbing and light shelf wear to extremities, including slight softening at spine ends. Binding remains firm and square. Interior clean and bright with no ownership markings noted. An attractive and well-preserved copy of this important introduction to computational learning theory, artificial intelligence, and formal models of learning. Please review photographs carefully, as they form part of the description. Returns accepted within the AbeBooks 30-day return window packed and shipped in a box. Shipped via USPS with tracking provided. International shipping available. Additional photographs available upon request. Sci 1a.
Condition: New.
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Condition: As New. Unread book in perfect condition.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.80
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New.
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condition: 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.
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Condition: Like New. Used - Like New. Book is new and unread but may have minor shelf wear. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
Language: English
Published by Springer Berlin Heidelberg, 1987
ISBN 10: 3540182535 ISBN 13: 9783540182535
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents developments of a language independent theory of program structure. The theory features a simple, natural notion of control structure which is much broader than in other theories of programming languages such as denotational semantics and program schemes. This notion permits treatment of control structures which involve not only the denotation of programs (i.e., their input/output behavior), but also their structure, size, run times, etc. The theory also treats the relation of control structure and complexity properties of programming languages. The book focuses on expressive interdependencies of control structures (which control structures can be expressed by which others). A general method of proving control structures expressively independent is developed. The book also considers characterizations of the expressive power of generalpurpose programming languages in terms of control structures. Several new characterizations are presented and two compactness results for such characterizations are shown.
Taschenbuch. Condition: Neu. A Connotational Theory of Program Structure | James S. Royer | Taschenbuch | viii | Englisch | 1987 | Springer | EAN 9783540182535 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Condition: Used. pp. 264.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 96.88
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 96.88
Quantity: Over 20 available
Add to basketCondition: New. In.
Condition: Used. pp. 264 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Condition: Used. pp. 264.
Seller: Mispah books, Redhill, SURRE, United Kingdom
Paperback. Condition: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.
Condition: New. pp. 264.
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. 1994. 1994th Edition. hardcover. . . . . .
Taschenbuch. Condition: Neu. Subrecursive Programming Systems | Complexity & Succinctness | James S. Royer (u. a.) | Taschenbuch | viii | Englisch | 2012 | Birkhäuser | EAN 9781461266808 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. 1994. 1994th Edition. hardcover. . . . . . Books ship from the US and Ireland.
Language: English
Published by Birkhäuser, Birkhäuser, 2012
ISBN 10: 1461266807 ISBN 13: 9781461266808
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 1.1. What This Book is About This book is a study of subrecursive programming systems, efficiency/program-size trade-offs between such systems, and how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest. 1.1.1. Subrecursive Programming Systems A subrecursive programming system is, roughly, a programming language for which the result of running any given program on any given input can be completely determined algorithmically. Typical examples are: 1. the Meyer-Ritchie LOOP language [MR67,DW83], a restricted assem bly language with bounded loops as the only allowed deviation from straight-line programming; 2. multi-tape 'lUring Machines each explicitly clocked to halt within a time bound given by some polynomial in the length ofthe input (see [BH79,HB79]); 3. the set of seemingly unrestricted programs for which one can prove 1 termination on all inputs (see [Kre51,Kre58,Ros84]); and 4. finite state and pushdown automata from formal language theory (see [HU79]). lOr, more precisely, the collection of programs, p, ofsome particular general-purpose programming language (e.g., Lisp or Modula-2) for which there is a proof in some par ticular formal system (e.g., Peano Arithmetic) that p halts on all inputs.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
£ 135.99
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. Like New. book.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Seller: Mispah books, Redhill, SURRE, United Kingdom
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Seller: CANO, BREST, France
Paris, à la librairie diplomatique, française et étrangère de J. P. Aillaud 1835. Tome 2 seul - 458 pages. Demi reliure, petits frattés et petites épidermures. Bon exemplaire.