
Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10307)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: CiE 2017.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Similar content being viewed by others
Keywords
- algorithmics
- computability
- formal languages and automata theory
- natural computing
- turing machine model
- automated theorem proving
- cellular automation
- classical computation
- cryptography and information theory
- geometric computation
- history and philosophy of computing
- logic
- mathematics of computing
- models of computation
- regular languages
- reversible computation
- signal machine
- theory of computation
- total turing machines
- uniformization theorem
Table of contents (37 papers)
-
Invited Papers
-
Contributed Papers
Other volumes
-
Unveiling Dynamics and Complexity
Editors and Affiliations
Bibliographic Information
Book Title: Unveiling Dynamics and Complexity
Book Subtitle: 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings
Editors: Jarkko Kari, Florin Manea, Ion Petre
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-58741-7
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG 2017
Softcover ISBN: 978-3-319-58740-0Published: 12 May 2017
eBook ISBN: 978-3-319-58741-7Published: 07 June 2017
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 401
Number of Illustrations: 57 b/w illustrations
Topics: Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Artificial Intelligence, Pattern Recognition, Discrete Mathematics in Computer Science, Mathematical Logic and Formal Languages