Recursion - Shopping2000.com

Algebraic Computability and Enumeration Models

Algebraic Computability and Enumeration Models ab 44.49 € als pdf eBook: Recursion Theory and Descriptive Complexity. Aus dem Bereich: eBooks, Belletristik, Erzählungen,

Shop: hugendubel
Price: 44.49 EUR excl. shipping

Comparative Metric Semantics of Programming Languages

Comparative Metric Semantics of Programming Languages ab 96.49 € als pdf eBook: Nondeterminism and Recursion. Aus dem Bereich: eBooks, Fachthemen & Wissenschaft, Mathematik,

Shop: hugendubel
Price: 96.49 EUR excl. shipping

O-Bibliography of Mathematical Logic

O-Bibliography of Mathematical Logic ab 92.99 € als Taschenbuch: Recursion Theory. Softcover reprint of the original 1st ed. 1987. Aus dem Bereich: Bücher, Taschenbücher, Naturwissenschaft,

Shop: hugendubel
Price: 92.99 EUR excl. shipping

Mathematical Logic

Mathematical Logic ab 125.49 € als Taschenbuch: A Course with Exercises Part II: Recursion Theory Godel's Theorems Set Theory Model Theory. Aus dem Bereich: Bücher, Wissenschaft, Mathematik,

Shop: hugendubel
Price: 125.49 EUR excl. shipping

Once Upon an Algorithm: How Stories Explain Computing , Hörbuch, Digital, ungekürzt, 648min

How Hansel and Gretel, Sherlock Holmes, the movie Groundhog Day, Harry Potter, and other familiar stories illustrate the concepts of computing. Picture a computer scientist, staring at a screen and clicking away frantically on a keyboard, hacking into a system, or perhaps developing an app. Now delete that picture. In Once Upon an Algorithm, Martin Erwig explains computation as something that takes place beyond electronic computers, and computer science as the study of systematic problem solving. Erwig points out that many daily activities involve problem solving. Getting up in the morning, for example: You get up, take a shower, get dressed, eat breakfast. This simple daily routine solves a recurring problem through a series of well-defined steps. In computer science, such a routine is called an algorithm. Erwig illustrates a series of concepts in computing with examples from daily life and familiar stories. Hansel and Gretel, for example, execute an algorithm to get home from the forest. The movie Groundhog Day illustrates the problem of unsolvability; Sherlock Holmes manipulates data structures when solving a crime; the magic in Harry Potter's world is understood through types and abstraction; and Indiana Jones demonstrates the complexity of searching. Along the way, Erwig also discusses representations and different ways to organize data; "intractable" problems; language, syntax, and ambiguity; control structures, loops, and the halting problem; different forms of recursion; and rules for finding errors in algorithms. This engaging book explains computation accessibly and shows its relevance to daily life. Something to think about next time we execute the algorithm of getting up in the morning. PLEASE NOTE: When you purchase this title, the accompanying reference material will be available in your Library section along with the audio. ungekürzt. Language: English. Narrator: Walter Dixon. Audio sample: https://samples.audible.de/bk/tant/011485/bk_tant_011485_sample.mp3. Digital audiobook in aax.

Shop: Audible
Price: 9.95 EUR excl. shipping

Logic and Structure

Dirk van Dalen's popular textbook Logic and Structure, now in its fifth edition, provides a comprehensive introduction to the basics of classical and intuitionistic logic, model theory and Gödel's famous incompleteness theorem. Propositional and predicate logic are presented in an easy-to-read style using Gentzen's natural deduction. The book proceeds with some basic concepts and facts of model theory: a discussion on compactness, Skolem-Löwenheim, non-standard models and quantifier elimination. The discussion of classical logic is concluded with a concise exposition of second-order logic. In view of the growing recognition of constructive methods and principles, intuitionistic logic and Kripke semantics is carefully explored. A number of specific constructive features, such as apartness and equality, the Gödel translation, the disjunction and existence property are also included. The last chapter on Gödel's first incompleteness theorem is self-contained and provides a systematic exposition of the necessary recursion theory. This new edition has been properly revised and contains a new section on ultra-products.

Shop: buecher
Price: 54.99 EUR excl. shipping

A Study of certain Special Functions

A Study of certain Special Functions ab 82.99 € als Taschenbuch: Generalizations Recursion Formulas and Derivatives with respect to Parameters of certain Special Functions. Aus dem Bereich: Bücher, Wissenschaft, Mathematik,

Shop: hugendubel
Price: 82.99 EUR excl. shipping

Venom by Al Ewing & RAM V Vol. 1: Recursion

No description.

Shop: buecher
Price: 17.99 EUR excl. shipping

Twins and Recursion in Digital, Literary and Visual Cultures