• Corpus ID: 60034540

# Foundations of Computing

@inproceedings{Gruska1997FoundationsOC,
title={Foundations of Computing},
author={Jozef Gruska},
year={1997}
}
Provides an introduction to the theory of computing science. Covering the main areas of complexity theory, automata and formal languages in a coherent way, the text also covers the theoretical aspects of more applied areas. The author's approach is to stimulate students' understanding of the relevance of theory to important application areas - for example, image processing, communication networks and cryptography are all discussed. The book also provides numerous examples, graded exercises and…
211 Citations
Book Review: foundations of computing
The book reviewed here emphasises motivation, interpretation, and explanation; serving the dual role of a textbook and a reference book.
An information theoretic approach to the expressiveness of programming languages
It is shown that the amount of information present in models of the same paradigm, or model family, is a good indication of relative expressivity and average program size, and the number of components in the circuits that realise the semantics and programs of the models correlates with the information required to implement the semanticsand program of a model.
From Implementations to a General Concept of Evolvable Machines
The questions related to formal definition and computational power are discussed and the concept is proposed in framework of traditional software and hardware implementations of evolvable machines.
On the Unusual Effectiveness of Logic in Computer Science
• Education
Bulletin of Symbolic Logic
• 2001
In 1960, E. P. Wigner published a paper titled On the Unreasonable Effectiveness of Mathematics in the Natural Sciences, which can be construed as an examination and affirmation of Galileo's tenet that “The book of nature is written in the language of mathematics”.
From Quantum Query Complexity to State Complexity
• Computer Science
Computing with New Resources
• 2014
A general method is presented and demonstrated that state succinctness results can be derived out of query complexity results, and is shown to be applicable to quantum finite automata.
Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey
Although applications are not yet seen, cellular automata in the hyperbolic plane may appear, especially in physics, in the theory of relativity or for cosmological researches.
New Challenges for Theoretical Computer Science
The aim of the panel is to point out and analyse new challenges theoretical computer science has to deal with in order to develop properly as fundamental science and to respond well to needs coming from the outside world, especially to those informatization of society and global networking bring.
Counting with Probabilistic and Ultrametric Finite Automata
• K. Balodis
• Computer Science
Computing with New Resources
• 2014
We investigate the state complexity of probabilistic and ultrametric finite automata for the problem of counting, i.e. recognizing the one-word unary language $$C_n=\left\{ 1^n \right\}$$. We also
Algebra of Networks
The first part of the paper contains an overview of Network Algebra (NA) book [35]. The second part introduces finite interactive systems as an abstract mathematical model of agents’ behaviour and
The gamut of dynamic logics
• Computer Science
Logic and the Modalities in the Twentieth Century
• 2006