Logo

Applicative Computing: Its quarks, atoms and molecules

Large book cover: Applicative Computing: Its quarks, atoms and molecules

Applicative Computing: Its quarks, atoms and molecules
by

Publisher: JurInfoR
ISBN/ASIN: 5891581779
ISBN-13: 9785891581777
Number of pages: 66

Description:
This work covers the advanced topics in main ideas of computing in general. The material is approved in practice of NRNU MEPhI, MIPT and several other educational centers of the Russian Federation. The book is suitable both for advanced learners and beginners in Computing and Information Technologies as well as in Discrete Mathematics.

Home page url

Download or read it online for free here:
Download link
(multiple formats)

Similar books

Book cover: Cellular Automata And Complexity: Collected PapersCellular Automata And Complexity: Collected Papers
by - Westview Press
These original papers on cellular automata and complexity provide a highly readable account of what has become a major new field of science, with important implications for computer science, physics, economics, biology, and many other areas.
(8515 views)
Book cover: Bayesian Computational MethodsBayesian Computational Methods
by - arXiv
We will first present the most standard computational challenges met in Bayesian Statistics, focusing primarily on mixture estimation and on model choice issues, and then relate these problems with computational solutions.
(4742 views)
Book cover: Rule-based Computation and DeductionRule-based Computation and Deduction
by - ESSLLI
This text first introduces the concept of rewriting which is behind rule-based systems. Then the rewriting logic and the rewriting calculus are defined and shown to be especially suited to describing concurrent and non-deterministic computations.
(4632 views)
Book cover: Introduction to Theory of ComputationIntroduction to Theory of Computation
by - Carleton University
This is a textbook for an undergraduate course on the Theory of Computation. Contents: Finite Automata and Regular Languages; Context-Free Languages; Turing Machines and Church-Turing Thesis; Decidable and Undecidable Languages; Complexity Theory.
(3406 views)