Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science

ISBN-10: 0122063821

ISBN-13: 9780122063824

Edition: 2nd 1994 (Revised)

List price: $72.95 Buy it from $37.53
eBook available
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description:

New Starting from $124.65
eBooks Starting from $72.95
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Customers also bought
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $72.95
Edition: 2nd
Copyright year: 1994
Publisher: Elsevier Science & Technology Books
Publication date: 2/3/1994
Binding: Hardcover
Pages: 609
Size: 6.25" wide x 9.00" long x 1.75" tall
Weight: 2.486
Language: English

Ron Sigal is an independently employed software developer who has held positions at Yale University, Lafayette College, Hofstra University, and the University of Catania in Italy. He has a PhD in computer science and has published in the areas of mathematical logic, robotics, and programming languages.

Preliminaries
Computability: Programs and Computable Functions
Primitive Recursive Functions
A Universal Program
Calculations on Strings
Turing Machines
Processes and Grammars
Classifying Unsolvable Problems
Grammars and Automata: Regular Languages
Context-Free Languages
Context-Sensitive Languages
Logic: Propositional Calculus
Quantification Theory
Complexity: Abstract Complexity
PolynomialTime Computability
Semantics: Approximation Orderings
Denotational Semantics of Recursion Equations
Operational Semantics of Recursion Equations
Suggestions for Further Reading
Subject Index
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×