Tourlakis (176 Ergebnisse)

hardcover. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Zustand: Good. Hardcover; Reston Publishing Company; surplus library copy with the usual s tampings; reference number taped to spine; fading and edge wear to exterior; cover cloth wearing at corners, ends of spine; otherwise in good conditio n with clean text, firm binding.

hardcover. Zustand: Very Good.

paperback. Zustand: Very Good. Most items will be dispatched the same or the next working day. A copy that has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Hardcover. Zustand: New. 1st Edition. Brand new, ship fast with USPS tracking No. Please understand we will not accept return for any reasons. Thanks.

Zustand: New. 1st ed. 2024 edition NO-PA16APR2015-KAP.

Paperback. Zustand: new. Paperback. This book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. Safe that is, paradox-free informal set theory is introduced following on the heels of Russells Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantors diagonalisation technique. Predicate logic for the user is introduced along with axioms and rules and extensive examples. Partial orders and the minimal condition are studied in detail with the latter shown to be equivalent to the induction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions of functions and sets. Techniques for solving recurrence relations including generating functions, the O- and o-notations, and trees are provided. Over 200 end of chapter exercises are included to further aid in the understanding and applications of discrete mathematics. This book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Zustand: New.

Zustand: New.

Paperback. Zustand: new. Paperback. This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of mechanical process using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarskis theorem on the non-representability of truth, Goedels incompleteness and Rossers incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Churchs thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oraclecomputations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blums complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: New. This two-volume work bridges the gap between introductory expositions of logic or set theory on one hand, and the research literature on the other. It can be used as a text in an advanced undergraduate or beginning graduate course in mathematics, computer science, or philosophy. The volumes are written in a user-friendly conversational lecture style that makes them equally effective for self-study or class use. Volume 1 includes formal proof techniques, a section on applications of compactness (including nonstandard analysis), a generous dose of computability and its relation to the incompleteness phenomenon, and the first presentation of a complete proof of Godel's 2nd incompleteness since Hilbert and Bernay's Grundlagen theorem.…

Zustand: As New. Unread book in perfect condition.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is ideal for afirst or second year discrete mathematics course formathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. 'Safe' - that is, paradox-free - informal set theory is introduced following on the heels of Russell's Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantor's diagonalisation technique. Predicate logic 'for the user' is introduced along with axioms and rules and extensive examples. Partial orders and theminimal conditionare studied in detail with the latter shown to be equivalent to theinduction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions offunctionsandsets. Techniques for solving recurrence relations including generating functions, the O- and o-notations, and trees are provided. Over 200 end of chapter exercises are included to further aid in the understanding and applications of discrete mathematics.…

Zustand: New. This two-volume set bridges the gap between introductory texts and the research literature. Series: Cambridge Studies in Advanced Mathematics. Num Pages: 342 pages, black & white illustrations. BIC Classification: PBCD; PBCH. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 229 x 152 x 19. Weight in Grams: 500. . 2006. paperback. . . . .…

Hardcover. Zustand: Fair. Book in Fair condition.

Zustand: New.

Hardcover. Zustand: Fair. 1. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Zustand: New.

Zustand: New. Satisfaction Guaranteed or your money back.

Zustand: New. In English.

Hardcover. Zustand: new. Hardcover. This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of mechanical process using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarskis theorem on the non-representability of truth, Goedels incompleteness and Rossers incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Churchs thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oraclecomputations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blums complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Zustand: As New. Unread book in perfect condition.

Hardcover. Zustand: Good. Book in Good condition.

Zustand: New.

Zustand: New. In English.