skip to content
Theories of computability Preview this item
ClosePreview this item
Checking...

Theories of computability

Author: Nicholas Pippenger
Publisher: Cambridge, U.K. ; New York, NY, USA : Cambridge University Press, 1997.
Edition/Format:   Print book : EnglishView all editions and formats
Summary:

A mathematically sophisticated introduction to Turing's theory, Boolean functions, automata, and formal languages.

Rating:

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

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

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

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Nicholas Pippenger
ISBN: 0521553806 9780521553803
OCLC Number: 35593710
Description: ix, 251 pages : illustrations ; 24 cm
Contents: Stories --
Three basic structures --
Boolean functions --
Clones --
The Finite-Basis Theorem --
Boolean relations --
Co-clones --
Finite functions and relations --
Sequential functions and relations --
Two basic structures --
Finite automata --
Regular expressions --
Logical expressions --
Aperiodic languages --
Varieties --
Extras --
Grammars --
Linear languages --
Context-free languages --
Ambiguity --
Enumerable languages --
Rational cones --
Rational cylinders and rays --
Substitution --
Generating functions --
Computability theory --
Recursive partial functions --
Recursively enumerable relations --
Turing reducibility --
Many-one reducibility --
One-one reducibility and recursive isomorphism --
Abstract complexity theory --
Computable real numbers.
Responsibility: Nicholas Pippenger.
More information:

Reviews

Editorial reviews

Publisher Synopsis

"The author is extremely precise and meticulous, giving as much care to a proof that any context-free language can be generated by a grammar in Greibach normal form (GNF) as to a priority argument." Read more...

 
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/35593710> # Theories of computability
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "35593710" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/45994053#Place/cambridge_u_k> ; # Cambridge, U.K.
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/45994053#Place/new_york_ny_usa> ; # New York, NY, USA
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/enk> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/45994053#Topic/langage_formel> ; # langage formel
    schema:about <http://experiment.worldcat.org/entity/work/data/45994053#Topic/fonction_recursive> ; # fonction récursive
    schema:about <http://experiment.worldcat.org/entity/work/data/45994053#Topic/automate_fini> ; # automate fini
    schema:about <http://experiment.worldcat.org/entity/work/data/45994053#Topic/fonction_finie> ; # fonction finie
    schema:about <http://experiment.worldcat.org/entity/work/data/45994053#Topic/calculabilite> ; # calculabilité
    schema:about <http://experiment.worldcat.org/entity/work/data/45994053#Topic/automates> ; # Automates
    schema:about <http://id.worldcat.org/fast/1004846> ; # Machine theory
    schema:about <http://experiment.worldcat.org/entity/work/data/45994053#Topic/computable_functions> ; # Computable functions
    schema:about <http://dewey.info/class/511.3/e20/> ;
    schema:bookFormat bgn:PrintBook ;
    schema:creator <http://viaf.org/viaf/161002576> ; # Nicholas Pippenger
    schema:datePublished "1997" ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/45994053> ;
    schema:inLanguage "en" ;
    schema:name "Theories of computability"@en ;
    schema:productID "35593710" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/35593710#PublicationEvent/cambridge_u_k_new_york_ny_usa_cambridge_university_press_1997> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/45994053#Agent/cambridge_university_press> ; # Cambridge University Press
    schema:url <http://catdir.loc.gov/catdir/toc/cam023/96044633.html> ;
    schema:url <http://www.gbv.de/dms/ilmenau/toc/218655436.PDF> ;
    schema:workExample <http://worldcat.org/isbn/9780521553803> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/35593710> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/45994053#Agent/cambridge_university_press> # Cambridge University Press
    a bgn:Agent ;
    schema:name "Cambridge University Press" ;
    .

<http://experiment.worldcat.org/entity/work/data/45994053#Place/cambridge_u_k> # Cambridge, U.K.
    a schema:Place ;
    schema:name "Cambridge, U.K." ;
    .

<http://experiment.worldcat.org/entity/work/data/45994053#Place/new_york_ny_usa> # New York, NY, USA
    a schema:Place ;
    schema:name "New York, NY, USA" ;
    .

<http://experiment.worldcat.org/entity/work/data/45994053#Topic/computable_functions> # Computable functions
    a schema:Intangible ;
    schema:name "Computable functions"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/45994053#Topic/fonction_recursive> # fonction récursive
    a schema:Intangible ;
    schema:name "fonction récursive"@en ;
    .

<http://id.worldcat.org/fast/1004846> # Machine theory
    a schema:Intangible ;
    schema:name "Machine theory"@en ;
    .

<http://viaf.org/viaf/161002576> # Nicholas Pippenger
    a schema:Person ;
    schema:familyName "Pippenger" ;
    schema:givenName "Nicholas" ;
    schema:name "Nicholas Pippenger" ;
    .

<http://worldcat.org/isbn/9780521553803>
    a schema:ProductModel ;
    schema:isbn "0521553806" ;
    schema:isbn "9780521553803" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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