Introduction to computer theory.

Contributor(s):

3G E-Learning

Material type: Text

TextPublisher: New York : 3G E-Learning, 2023Edition: 2nd editionDescription: xi, 256 pages : illustrations ; 25 cmContent type:

text

Media type:

unmediated

Carrier type:

volume

ISBN:

9781984680051

Subject(s):

DDC classification:

004.0151 In891

LOC classification:

QA267 .I58 2023

Contents:

Computer fundamentals -- Finite automata -- Pushdown automata theory -- Turing machines -- Algorithms -- Distributed computing -- Computational complexity.

Summary: "Theory of Computation or Theory of Automata is the core area of computer science and engineering. It is the branch that aims to try the deep understanding of computational processes by effectively solving the problems with mathematical models, tools and techniques. This understanding is important for its applications, which span various computational models such as algorithms, compilers, and VLSI design to the creation of intelligent technology, cognitive psychology, and philosophy. Automata enables scientists to understand how machines compute functions and solve problems. The main motivation behind the development of automata theory was the development of methods for describing and analyzing the dynamic behavior of discrete systems. To conduct a thorough computational study, computer scientist's work with a mathematical abstraction of computers called a computational model. Several models are used, but the most studied is the Turing machine. Computer scientists study the Turing machine because it is easy to formulate, can be analyzed and used to prove results, and because it represents what many consider to be the most powerful possible reasonable computational model. It may seem that the potentially infinite memory capacity is an unrealizable attribute, but any decidable problem solved by a Turing machine always requires a finite amount of memory. So, in principle, any problem that can be solved by a Turing machine can be solved by a computer that has a finite amount of memory. The content coverage in this edition is organized into seven chapters. This edition is completely revised and new The content coverage in this edition is organized into seven chapters. This edition is completely revised and new topics are added. The book addresses the fundamental questions about the nature of computation while at the same time helping we better understand the ways in which we interact with the computer." -- Back cover

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Shelving location	Call number	Copy number	Status	Date due	Barcode
Books	Main Library	Circulation Section	CIR 004.0151 In891 2023 (Browse shelf(Opens below))	1-2	Available		030952
Books	Main Library	Circulation Section	CIR 004.0151 In891 2023 (Browse shelf(Opens below))	2-2	Available		030953

Includes bibliographical references and index.

Computer fundamentals -- Finite automata -- Pushdown automata theory -- Turing machines -- Algorithms -- Distributed computing -- Computational complexity.

"Theory of Computation or Theory of Automata is the core area of computer science and engineering. It is the branch that aims to try the deep understanding of computational processes by effectively solving the problems with mathematical models, tools and techniques. This understanding is important for its applications, which span various computational models such as algorithms, compilers, and VLSI design to the creation of intelligent technology, cognitive psychology, and philosophy. Automata enables scientists to understand how machines compute functions and solve problems. The main motivation behind the development of automata theory was the development of methods for describing and analyzing the dynamic behavior of discrete systems. To conduct a thorough computational study, computer scientist's work with a mathematical abstraction of computers called a computational model. Several models are used, but the most studied is the Turing machine. Computer scientists study the Turing machine because it is easy to formulate, can be analyzed and used to prove results, and because it represents what many consider to be the most powerful possible reasonable computational model. It may seem that the potentially infinite memory capacity is an unrealizable attribute, but any decidable problem solved by a Turing machine always requires a finite amount of memory. So, in principle, any problem that can be solved by a Turing machine can be solved by a computer that has a finite amount of memory.
The content coverage in this edition is organized into seven chapters. This edition is completely revised and new The content coverage in this edition is organized into seven chapters. This edition is completely revised and new topics are added. The book addresses the fundamental questions about the nature of computation while at the same time helping we better understand the ways in which we interact with the computer." -- Back cover

There are no comments on this title.

to post a comment.