A Recursive Introduction to the Theory of Computation

Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:A Recursive Introduction To The Theory Of ComputationISBN13:9781461264200ISBN10:1461264200Author:Smith, Carl (Author)Description:The Aim Of This Textbook Is To Present An Account Of The Theory Of Computation After Introducing The Concept Of A Model Of Computation And Presenting Various Examples, The Author Explores The Limitations Of Effective Computation Via Basic Recursion Theory Self-Reference And Other Methods Are Introduced As Fundamental And Basic Tools For Constructing And Manipulating Algorithms From There The Book Considers The Complexity Of Computations And The Notion Of A Complexity Measure Is Introduced Finally, The Book Culminates In Considering Time And Space Measures And In Classifying Computable Functions As Being Either Feasible Or Not The Author Assumes Only A Basic Familiarity With Discrete Mathematics And Computing, Making This Textbook Ideal For A Graduate-Level Introductory Course It Is Based On Many Such Courses Presented By The Author And So Numerous Exercises Are Included In Addition, The Solutions To Most Of These Exercises Are Provided Binding:Paperback, PaperbackPublisher:SPRINGER NATUREPublication Date:2012-11-22Weight:0.49 lbsDimensions:0.34'' H x 9'' L x 6'' WNumber of Pages:148Language:English

Price: 55.13 USD

Location: USA

End Time: 2024-03-03T05:53:25.000Z

Shipping Cost: 0 USD