Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings

This book constitutes the refereed proceedings of the 13th Conference on Computability in Europe, CiE 2017, held in Turku, Finland, in June 2017. The 24 revised full papers and 12 invited papers were carefully reviewed and selected from 69 submissions. The conference CiE 2016 has six special sessions, namly: algorithmics for biology; combinatorics and algorithmics on words; computability in analysis, algebra, and geometry; cryptography and information theory; formal languages and automata theory; and history and philosophy of computing.

List of contents

Algorithmics for biology.- Combinatorics and algorithmics on words.- Computability in analysis, algebra, and geometry.-Cryptography and information theory.- Formal languages and automata theory.- History and philosophy of computing.

Product details

• Assisted by: Jarkko Kari (Editor), Florin Manea (Editor), Ion Petre (Editor)
• Publisher: Springer, Berlin
• Languages: English
• Product format: Paperback / Softback
• Released: 12.05.2017
• EAN: 9783319587400
• ISBN: 978-3-31-958740-0
• No. of pages: 401
• Dimensions: 157 mm x 24 mm x 236 mm
• Weight: 635 g
• Illustrations: XIII, 401 p. 57 illus.
• Series: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > IT; C, Künstliche Intelligenz, Algorithmen und Datenstrukturen, Algorithms, Artificial Intelligence, Mustererkennung, Diskrete Mathematik, Mathematik für Informatiker, computer science, Theory of Computation, pattern recognition, Discrete Mathematics in Computer Science, Discrete Mathematics, Computers, Algorithms & data structures, Automated Pattern Recognition, Mathematical theory of computation, Computer science—Mathematics, Maths for computer scientists, Algorithm Analysis and Problem Complexity, Mathematical logic, Mathematical Logic and Formal Languages, Computation by Abstract Devices, Formal Languages and Automata Theory, uniformization theorem