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: Models of Computation: Exploring the Power of ComputingModels of Computation: Exploring the Power of Computing
by - Addison-Wesley
The book re-examines computer science, giving priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages. This viewpoint is motivated by more realistic computational models.
(5792 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.
(5677 views)
Book cover: Logic and ProofLogic and Proof
by - University of Cambridge
These lecture notes give a brief introduction to logic, with including the resolution method of theorem-proving and its relation to the programming language Prolog. Formal logic is used for specifying and verifying computer systems.
(10218 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.
(4752 views)