Kategorien
Handverlesen
Verbrieft
Kafka, Kafka, Kafka
Alice Munro
Archiv
Viel besprochen
Bücherschau des Tages
Literaturbeilagen
Bücherbrief
Bücher der Saison
Bestenlisten
Ausgezeichnet
Selbst gelesen
von Marie-Luise Knott
von Thekla Dannenberg
von Peter Truschner
von Angela Schader
Wer wir sind
Datenschutz
Impressum
Gutschein
Kostenloser Newsletter
Der
Perlentaucher unter den Buchläden
Eichendorff21
Warenkorb
Einloggen oder registrieren
Genauer suchen (23 Treffer)
Filter schließen (23 Treffer)
Stichwort auswählen
Alle Stichworte
Turingmachine (23)
Algorithms (10)
Complexity (10)
Cellularautomata (7)
Logic (5)
Algorithm (4)
Automata (4)
Computability (4)
Mathematicalmachines (4)
Calculus (3)
Computabilitytheory (3)
Formallanguage (3)
Information (3)
Modelsofcomputation (3)
Oracles (3)
Relativecomputability (3)
Verification (3)
Approximation (2)
Arithmetic (2)
Bhkinterpretation (2)
Canonicalproof (2)
Church-Turingthesis (2)
Classificationtheory (2)
Communication (2)
Complexitylogicaltheory (2)
Computerscience (2)
Computingmachines (2)
Concurrency (2)
Concurrencymodels (2)
Contructivemathematics (2)
Conway¿sgameoflife (2)
Countermachine (2)
Effectiveprocedures (2)
Formallanguages (2)
Grammars (2)
Grossones (2)
Historyofcomputing (2)
Kolmogorovcomplexity (2)
Logig (2)
Mathematics (2)
Modeling (2)
Network (2)
Online (2)
P-Systems (2)
Recursiontheory (2)
Theoryofcomputation (2)
Turingdegree (2)
Universalcomputation (2)
Userinterface (2)
Asses (1)
Automatatheory (1)
Automatentheorie (1)
Bezout'sidentity (1)
Categorytheory (1)
Cellularautomatagroups (1)
Combinatorics (1)
Complexitytheory (1)
Computationalcomplexity (1)
Computationalgeometry (1)
Computer (1)
Cryptography (1)
Discretedynamicalsystem (1)
Dynamicalsystem (1)
Embeddedsystems (1)
Entscheidung(math.) (1)
Equivalence (1)
Equivalenceproblem (1)
Formalmethods (1)
Function (1)
Functionallanguages (1)
Gametheory (1)
Graph (1)
Graphtheory (1)
Group (1)
Historyofmathematics (1)
Informationtheory (1)
Interpolation (1)
Isomorphismproblem (1)
Komplexität(math.) (1)
Logarithms (1)
Mathematica (1)
Mathematicallogic (1)
Networkprotocols (1)
Newton'smethod (1)
Notation (1)
Np-Hard (1)
Petrinet (1)
Programminglanguage (1)
Programtransformation (1)
Programverification (1)
Proof (1)
Reachability (1)
Real-Timesystems (1)
Regularexpressions (1)
Rekursivefunktion (1)
Reversibility (1)
Rewriting (1)
Satisfiabilityproblem (1)
Semantics (1)
Sets (1)
Schlagwort-Sachbuch auswählen
Schlagwort Sachbuch
Kybernetik und Systemtheorie (6)
Mathematik: Logik (5)
Algorithmen und Datenstrukturen (3)
Theoretische Informatik (3)
Mathematik für Informatiker (2)
Numerische Mathematik (2)
Diskrete Mathematik (1)
Mathematik (1)
Sprache auswählen
Sprachen
Englisch (23)
Buchform auswählen (BC=Taschenbuch,BB=Gebunden)
Formate
Taschenbuch (17)
Gebunden (6)
Nur mit
-Notizen
Auf Lager
Sortiert nach
Übereinstimmung
Neueste
Preis absteigend
Preis aufsteigend
Seitenzahl aufsteigend
Seitenzahl absteigend
Suchergebnis
Gefundene Autoren:
Borut Robi¿
oder
Paul Rendell
oder
Hans Hermes
oder
Dexter C. Kozen
oder
Thomas Thierauf
eng
Borut Robi¿
The Foundations of Computability Theory
Springer Berlin Heidelberg
2021
Taschenbuch
444 Seiten
69,54
€
in Kürze
This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into histo…
eng
Borut Robi¿
The Foundations of Computability Theory
Springer Berlin Heidelberg
2020
Gebunden
444 Seiten
96,29
€
in Kürze
This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into histo…
eng
Reversibility and Universality
Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday
Springer International Publishing
2019
Taschenbuch
496 Seiten
106,99
€
in Kürze
This book is a tribute to Kenichi Moritäs ideas and achievements in theoretical computer science, reversibility and computationally universal mathema…
eng
Reversibility and Universality
Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday
Springer International Publishing
2018
Gebunden
496 Seiten
106,99
€
in Kürze
This book is a tribute to Kenichi Moritäs ideas and achievements in theoretical computer science, reversibility and computationally universal mathema…
eng
Borut Robi¿
The Foundations of Computability Theory
Springer Berlin Heidelberg
2016
Taschenbuch
352 Seiten
64,19
€
in Kürze
This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into histo…
eng
Paul Rendell
Turing Machine Universality of the Game of Life
Springer International Publishing
2016
Taschenbuch
196 Seiten
106,99
€
in Kürze
This book presents a proof of universal computation in the Game of Life cellular automaton by using a Turing machine construction. It provides an int…
eng
Constructivity and Computability in Historical and Philosophical Perspective
Springer Netherlands
2016
Taschenbuch
228 Seiten
53,49
€
in Kürze
Ranging from Alan Turing¿s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the…
eng
Automata, Universality, Computation
Tribute to Maurice Margenstern
Springer International Publishing
2016
Taschenbuch
432 Seiten
106,99
€
in Kürze
This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation. World top experts…
eng
Cellular Automata and Discrete Complex Systems
22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016, Proceedings
Springer International Publishing
2016
Taschenbuch
216 Seiten
53,49
€
in Kürze
This volume constitutes the thoroughly refereed proceedings of the 22nd IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex …
eng
Paul Rendell
Turing Machine Universality of the Game of Life
Springer International Publishing
2015
Gebunden
196 Seiten
106,99
€
in Kürze
This book presents a proof of universal computation in the Game of Life cellular automaton by using a Turing machine construction. It provides an int…
eng
Automata, Universality, Computation
Tribute to Maurice Margenstern
Springer International Publishing
2014
Gebunden
432 Seiten
106,99
€
in Kürze
eng
Constructivity and Computability in Historical and Philosophical Perspective
Springer Netherlands
2014
Gebunden
228 Seiten
53,49
€
in Kürze
Ranging from Alan Turing¿s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the…
eng
Interactive Theorem Proving
5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings
Springer International Publishing
2014
Taschenbuch
580 Seiten
53,49
€
in Kürze
This book constitutes the proceedings of the 5th International Conference on Interactive Theorem Proving, ITP 2014, Held as Part of the Vienna Summer…
eng
Dexter C. Kozen
Automata and Computability
Springer New York
2012
Taschenbuch
420 Seiten
53,49
€
in Kürze
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's…
eng
Hans Hermes
Enumerability · Decidability Computability
An Introduction to the Theory of Recursive Functions
Springer Berlin Heidelberg
2012
Taschenbuch
264 Seiten
53,49
€
in Kürze
Once we have accepted a precise replacement of the concept of algo rithm, it becomes possible to attempt the problem whether there exist well-define…
eng
Interactive Computation
The New Paradigm
Springer Berlin Heidelberg
2010
Taschenbuch
504 Seiten
160,49
€
in Kürze
The interaction paradigm is a new conceptualization of computational phenomena that emphasizes interaction over algorithms, reflecting the shift in t…
eng
Fundamentals of Computation Theory
17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009, Proceedings
Springer Berlin Heidelberg
2009
Taschenbuch
372 Seiten
53,49
€
in Kürze
This book constitutes the refereed proceedings of the 17th International Symposium Fundamentals of Computation Theory, FCT 2009, held in Wroclaw, Pol…
eng
Interactive Computation
The New Paradigm
Springer Berlin Heidelberg
2006
Gebunden
504 Seiten
160,49
€
in Kürze
The interaction paradigm is a new conceptualization of computational phenomena that emphasizes interaction over algorithms, reflecting the shift in t…
eng
Thomas Thierauf
The Computational Complexity of Equivalence and Isomorphism Problems
Springer Berlin Heidelberg
2000
Taschenbuch
148 Seiten
53,49
€
in Kürze
eng
A History of Algorithms
From the Pebble to the Microchip
Springer Berlin Heidelberg
1999
Taschenbuch
536 Seiten
106,99
€
in Kürze
The development of computing has reawakened interest in algorithms. Often neglected by historians and modern scientists, algorithmic procedures have …
eng
Fundamentals of Computation Theory
International Conference FCT '89, Szeged, Hungary, August 21-25, 1989. Proceedings
Springer Berlin Heidelberg
1989
Taschenbuch
516 Seiten
53,49
€
in Kürze
This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The confere…
eng
Logic and Machines: Decision Problems and Complexity
Proceedings of the Symposium ¿Rekursive Kombinatorik¿ held from May 23¿28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfalen
Springer Berlin Heidelberg
1984
Taschenbuch
472 Seiten
37,44
€
in Kürze
eng
Mathematical Foundations of Computer Science 1979
8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings
Springer Berlin Heidelberg
1979
Taschenbuch
596 Seiten
42,79
€
in Kürze
A sound and complete proof system for partial program correctness.- The problem of reachability and verification of programs.- Assertion programming.…
/9783662624234.png "The Foundations of Computability Theory")
/9783662624203.png "The Foundations of Computability Theory")
/9783030103347.png "Reversibility and Universality")
/9783319732152.png "Reversibility and Universality")
/9783662516010.png "The Foundations of Computability Theory")
/9783319370446.png "Turing Machine Universality of the Game of Life")
/9789402407075.png "Constructivity and Computability in Historical and Philosophical Perspective")
/9783319363677.png "Automata, Universality, Computation")
/9783319392998.png "Cellular Automata and Discrete Complex Systems")
/9783319198415.png "Turing Machine Universality of the Game of Life")
/9783319090382.png "Automata, Universality, Computation")
/9789401792165.png "Constructivity and Computability in Historical and Philosophical Perspective")
/9783319089690.png "Interactive Theorem Proving")
/9781461273097.png "Automata and Computability")
/9783642461804.png "Enumerability · Decidability Computability")
/9783642071027.png "Interactive Computation")
/9783642034084.png "Fundamentals of Computation Theory")
/9783540346661.png "Interactive Computation")
/9783540410324.png "The Computational Complexity of Equivalence and Isomorphism Problems")
/9783540633693.png "A History of Algorithms")
/9783540514985.png "Fundamentals of Computation Theory")
/9783540133315.png "Logic and Machines: Decision Problems and Complexity")
/9783540095262.png "Mathematical Foundations of Computer Science 1979")