skip to content
Theory of computation Preview this item
ClosePreview this item
Checking...

Theory of computation

Author: George J Tourlakis
Publisher: Hoboken, N.J. : Wiley, ©2012.
Edition/Format:   Print book : EnglishView all editions and formats
Summary:
"In the (meta)theory of computing, the fundamental questions of the limitations of computing are addressed. These limitations, which are intrinsic rather than technology dependent, may immediatly rule out the existence of algorithmic solutions for some problems while for others they rule out efficient solutions. The author's approach is anchored on the concrete (and assumed) practical knowledge about general
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: George J Tourlakis
ISBN: 9781118014783 1118014782
OCLC Number: 760978475
Description: xvii, 389 pages : illustrations ; 25 cm
Contents: 1 Mathematical foundations --
2. Algorithms, computable functions and computations --
3. A subset of the URM language; FA and NFA --
4. Adding a stack to a NFA: pushdown automata --
5. Computational complexity.
Responsibility: George Tourlakis.

Abstract:

With a focus on Unbound Register Machines (URMs), this book introduces new ideas and topics using real computer-related examples to help readers gain the skills and intuition that are key to  Read more...

Reviews

Editorial reviews

Publisher Synopsis

This is an outstanding book, and I recommend it highly to students and practitioners alike. (Computing Reviews, 8 April 2013)

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/760978475> # Theory of computation
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "760978475" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/1075729378#Place/hoboken_n_j> ; # Hoboken, N.J.
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nju> ;
    schema:about <http://id.worldcat.org/fast/871985> ; # Computable functions
    schema:about <http://dewey.info/class/511.352/e23/> ;
    schema:about <http://id.worldcat.org/fast/936087> ; # Functional programming languages
    schema:about <http://experiment.worldcat.org/entity/work/data/1075729378#Topic/mathematics_discrete_mathematics> ; # MATHEMATICS--Discrete Mathematics
    schema:about <http://experiment.worldcat.org/entity/work/data/1075729378#Topic/mathematics> ; # Mathematics
    schema:bookFormat bgn:PrintBook ;
    schema:copyrightYear "2012" ;
    schema:creator <http://viaf.org/viaf/74087808> ; # George J. Tourlakis
    schema:datePublished "2012" ;
    schema:description "1 Mathematical foundations -- 2. Algorithms, computable functions and computations -- 3. A subset of the URM language; FA and NFA -- 4. Adding a stack to a NFA: pushdown automata -- 5. Computational complexity."@en ;
    schema:description ""In the (meta)theory of computing, the fundamental questions of the limitations of computing are addressed. These limitations, which are intrinsic rather than technology dependent, may immediatly rule out the existence of algorithmic solutions for some problems while for others they rule out efficient solutions. The author's approach is anchored on the concrete (and assumed) practical knowledge about general computer programming, attained readers in a first year programming course, as well as the knowledge of discrete mathematics at the same level. The book develops the metatheory of general computing and builds on the reader's prior computing experience. Metatheory via the programming formalism known as Shepherdson-Sturgis Unbounded Register Machines (URM)--a straightforward abstraction of modern highlevel programming languages--is developed. Restrictions of the URM programming language are also discussed. The author has chosen to focus on the highlevel language approach of URMs as opposed to the Turing Machine since URMs relate more directly to programming learned in prior experiences. The author presents the topics of automata and languages only after readers become familiar, to some extent, with the (general) computability theory including the special computability theory of more "practical" functions, the primitive recursive functions. Automata are presented as a very restricted programming formalism, and their limitations (in expressivity) and their associated languages are studied. In addition, this book contains tools that, in principle, can search a set of algorithms to see whether a problem is solvable, or more specifically, if it can be solved by an algorithm whose computations are efficient. Chapter coverage includes: Mathematical Background; Algorithms, Computable Functions, and Computations; A Subset of the URM Language: FA and NFA; and Adding a Stack to an NFA: Pushdown Automata"--"@en ;
    schema:description ""The book develops the metatheory of general computing and builds on the reader's prior computing experience. Metatheory via the programming formalism known as Shepherdson-Sturgis Unbounded Register Machines (URM)--a straightforward abstraction of modern high-level programming languages--is developed. Restrictions of the URM programming language are also discussed. The author has chosen to focus on the high-level language approach of URMs as opposed to the Turing Machine since URMs relate more directly to programming learned in prior experiences"--"@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/1075729378> ;
    schema:inLanguage "en" ;
    schema:name "Theory of computation"@en ;
    schema:productID "760978475" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/760978475#PublicationEvent/hoboken_n_j_wiley_2012> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/1075729378#Agent/wiley> ; # Wiley
    schema:workExample <http://worldcat.org/isbn/9781118014783> ;
    umbel:isLike <http://bnb.data.bl.uk/id/resource/GBB223698> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/760978475> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/1075729378#Place/hoboken_n_j> # Hoboken, N.J.
    a schema:Place ;
    schema:name "Hoboken, N.J." ;
    .

<http://experiment.worldcat.org/entity/work/data/1075729378#Topic/mathematics_discrete_mathematics> # MATHEMATICS--Discrete Mathematics
    a schema:Intangible ;
    schema:name "MATHEMATICS--Discrete Mathematics"@en ;
    .

<http://id.worldcat.org/fast/871985> # Computable functions
    a schema:Intangible ;
    schema:name "Computable functions"@en ;
    .

<http://id.worldcat.org/fast/936087> # Functional programming languages
    a schema:Intangible ;
    schema:name "Functional programming languages"@en ;
    .

<http://viaf.org/viaf/74087808> # George J. Tourlakis
    a schema:Person ;
    schema:familyName "Tourlakis" ;
    schema:givenName "George J." ;
    schema:name "George J. Tourlakis" ;
    .

<http://worldcat.org/isbn/9781118014783>
    a schema:ProductModel ;
    schema:isbn "1118014782" ;
    schema:isbn "9781118014783" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.