Automata, Universality, Computation: Tribute to Maurice Margenstern: 12 (Emergence, Complexity and Computation, 12) - Image 1

£74.85

Springer Automata, Universality, Computation: Tribute to Maurice Margenstern: 12 (Emergence, Complexity and Computation, 12)

Name: Automata, Universality, Computation: Tribute to Maurice Margenstern: 12 (Emergence, Complexity and Computation, 12)
Brand: Springer
Price: 74.85 GBP
Availability: InStock

Architecture & Microprocessors

It has never been this cheap. We have no record of a lower price.

£75 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 78 days · 78 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 78 days • 1 price levels

Days at Price

Price Analysis

Most common price: £75 (78 days, 100.0%)

Price range: £75 - £75

Price levels: 1 different prices over 78 days

Description

This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation. World top experts in computer science and mathematics overview exciting and intriguing topics of logical theory of monoids, geometry of Gauss word, philosophy of mathematics in computer science, asynchronous and parallel P-systems, decidability in cellular automata, splicing systems, reversible Turing machines, information flows in two-way finite automata, prime generators in automaton arrays, Grossone and Turing machines, automaton models of atomic lattices. The book is full of visually attractive examples of mathematical machines, open problems and challenges for future research. Those interested in the advancement of a theory of computation, philosophy of mathematics, future and emergent computing paradigms, architectures and implementations will find the book vital for their research and development.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3319090380
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 01 December 2014
Listed Since: 12 June 2014

Barcode

No barcode data available

Springer Automata, Universality, Computation: Tribute to Maurice Margenstern: 12 (Emergence, Complexity and Computation, 12)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Automata, Logics, and Infinite Games: A Guide to Current Research: 2500 (Lecture Notes in Computer Science, 2500)

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Mathematical Foundations of Computer Science

Formal Models of Communicating Systems: Languages, Automata, and Monadic Second-Order Logic (Texts in Theoretical Computer Science. an Eatcs Series)

Automata and Computability (Undergraduate Texts in Computer Science)

Rudiments of Calculus (Volume 146) (Studies in Logic and the Foundations of Mathematics, Volume 146)

Automata and Computability: A Programmer's Perspective

Automata and Languages (Oxford Science Publications)

Automata Theory

Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)

Sequences, Groups, and Number Theory (Trends in Mathematics)

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)

Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I: 9134 (Lecture Notes in Computer Science, 9134)

Automata Theory with Modern Applications

Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998: 1450 (Lecture Notes in Computer Science, 1450)

STACS 93: 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993. Proceedings: 665 (Lecture Notes in Computer Science, 665)

Automata Theory with Modern Applications

Logic and Automata: History and Perspectives: 2 (Texts in Logic and Games)

Groups, Modules, and Model Theory - Surveys and Recent Developments: In Memory of Rüdiger Göbel

Finite Automata, Their Algebras and Grammars: Towards a Theory of Formal Expressions

From Boolean Logic to Switching Circuits and Automata: Towards Modern Information Technology: 335 (Studies in Computational Intelligence, 335)

Automata Implementation: First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29 - 31, 1996, Revised Papers: 1260 (Lecture Notes in Computer Science, 1260)

Theory of Computation: Automata, Formal Languages, Computation and Complexity