๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Physics and Theoretical Computer Science: From Numbers and Languages to

โœ Scribed by J.-P. Gazeau, J. Nesetril and B. Rovan, Editors


Publisher
IOS Press
Year
2007
Tongue
English
Leaves
349
Series
Quantum) Cryptography - Volume 7 NATO Security through Science Series: ... - Information and Communication Security
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


The goal of this publication is to reinforce the interface between physical sciences, theoretical computer science, and discrete mathematics. The intersection of combinatorics and statistical physics has been an area of great activity over the past few years, fertilized by an exchange not only of techniques but of objectives as well. Some of the topics of particular interest are: percolation, random coloring, mixing, homomorphisms from and to fixed graph, phase transitions, threshold phenomena. This book is aimed to assemble theoretical physicists and specialists of theoretical informatics and discrete mathematics in order to learn more about recent developments in cryptography, algorithmics, symbolic calculus, non-standard numeration systems, algebraic combinatorics, automata etc., which could reveal themselves to be of crucial interest in natural sciences. This volume is organized along the following rough thematic division: Physics; Chaos and Fractals; Quasi-Crystals and Tilings; Numeration, Automata, and Languages; Algebraic Combinatorics; and Graphs and Networks.

IOS Press is an international science, technical and medical publisher of high-quality books for academics, scientists, and professionals in all fields.

Some of the areas we publish in:

-Biomedicine
-Oncology
-Artificial intelligence
-Databases and information systems
-Maritime engineering
-Nanotechnology
-Geoengineering
-All aspects of physics
-E-governance
-E-commerce
-The knowledge economy
-Urban studies
-Arms control
-Understanding and responding to terrorism
-Medical informatics
-Computer Sciences


๐Ÿ“œ SIMILAR VOLUMES


Physics and Theoretical Computer Science
โœ J.-P. Gazeau, J. Nesetril and B. Rovan, Editors ๐Ÿ“‚ Library ๐Ÿ“… 2007 ๐Ÿ› IOS Press,US ๐ŸŒ English

The goal of this publication is to reinforce the interface between physical sciences, theoretical computer science, and discrete mathematics. The intersection of combinatorics and statistical physics has been an area of great activity over the past few years, fertilized by an exchange not only of te

Physics and Theoretical Computer Science
โœ Jean-Pierre Gazeau, Jaroslav Nesetril, Branislav Rovan ๐Ÿ“‚ Library ๐Ÿ“… 2007 ๐ŸŒ English

The goal of this publication is to reinforce the interface between physical sciences, theoretical computer science, and discrete mathematics. The intersection of combinatorics and statistical physics has been an area of great activity over the past few years, fertilized by an exchange not only of te

Computability, Complexity and Languages:
โœ Martin Davis, Elaine J. Weyuker ๐Ÿ“‚ Library ๐Ÿ“… 1983 ๐Ÿ› Academic Press Inc ๐ŸŒ English

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability

Computability, complexity, and languages
โœ Davis M., Sigal R., Weyuker E. ๐Ÿ“‚ Library ๐Ÿ“… 1994 ๐Ÿ› AP ๐ŸŒ English

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability

Computability, complexity and languages:
โœ Davis M., Weyuker E. ๐Ÿ“‚ Library ๐Ÿ“… 1983 ๐Ÿ› AP ๐ŸŒ English

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability