Learning Resource and Development

Introduction to computer theory. (Record no. 31425)

MARC details
000 -LEADER
fixed length control field 03108nam a2200313 i 4500
003 - CONTROL NUMBER IDENTIFIER
control field CSPC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260114101627.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 260112s2023 nyua b 001 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781984680051
040 ## - CATALOGING SOURCE
Original cataloging agency CSPC
Language of cataloging eng
Transcribing agency CSPC
Description conventions rda
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA267
Item number .I58 2023
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Item number In891
245 00 - TITLE STATEMENT
Title Introduction to computer theory.
250 ## - EDITION STATEMENT
Edition statement 2nd edition.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture New York :
Name of producer, publisher, distributor, manufacturer 3G E-Learning,
Date of production, publication, distribution, manufacture, or copyright notice 2023.
300 ## - PHYSICAL DESCRIPTION
Extent xi, 256 pages :
Other physical details illustrations ;
Dimensions 25 cm.
336 ## - CONTENT TYPE
Source rdacontent
Content type term text
337 ## - MEDIA TYPE
Source rdamedia
Media type term unmediated
338 ## - CARRIER TYPE
Source rdacarrier
Carrier type term volume
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references and index.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Computer fundamentals -- Finite automata -- Pushdown automata theory -- Turing machines -- Algorithms -- Distributed computing -- Computational complexity.
520 ## - SUMMARY, ETC.
Summary, etc. "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. <br/>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
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Theory of computation.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Automata theory.
710 1# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element 3G E-Learning.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Suppress in OPAC No
Koha item type Books
Classification part 004.0151
Item part In891
Call number prefix CIR
Call number suffix 2023
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Shelving location Date acquired Total Checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Dewey Decimal Classification     Main Library Main Library Circulation Section 01/12/2026   CIR 004.0151 In891 2023 030952 01/12/2026 1-2 01/12/2026 Books
    Dewey Decimal Classification     Main Library Main Library Circulation Section 01/12/2026   CIR 004.0151 In891 2023 030953 01/12/2026 2-2 01/12/2026 Books