Items related to Computing theory and symbolic logic(Chinese Edition)

Computing theory and symbolic logic(Chinese Edition) - Softcover

 
Image Not Available
  • PublisherScience Press
  • Publication date2000
  • ISBN 10 7030324102
  • ISBN 13 9787030324108
  • BindingPaperback
  • LanguageChinese

Search results for Computing theory and symbolic logic(Chinese Edition)

Stock Image

ZHANG XING YUAN . WANG YUAN YUAN . SONG LI HUA
Published by Science Press, 2000
ISBN 10: 7030324102 ISBN 13: 9787030324108
New paperback

Seller: liu xing, Nanjing, JS, China

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

paperback. Condition: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: October 2011 Pages: 270 Language: Chinese Publisher: Science Press Ordinary Higher Education Eleventh Five-Year national planning materials: Calculate the theory and symbolic logic of group computing theory and mathematical logic. the most basic and important concepts in detail. Computability and logic boolos classic textbook as a starting point from teaching results. simplify and enrich the content. Regular higher education Eleventh Five-Year national planning materials: calculation theory and symbolic logic pay attention to reflect the application of mathematical logic in computer science research. emphasizing the intuitive feeling combined with the theoretical analysis. The definitions. theorems introduction of well-designed. easy-to-understand style of proof. followed by the important chapters Summary. Trying to guide the reader beyond the technical details. and to pay more attention to the definitions. theorems hidden behind the general mode of thinking and ways of thinking. the theory of learning is no longer boring. Ordinary higher education Eleventh Five-Year national planning materials: calculation of the theoretical and symbolic logic can be used as a textbook of mathematics. computer science professional researchers in the field of software engineering. formal methods. artificial intelligence. mathematical logic and engineering and technical personnel beneficial to enhance the level of rational thinking and analysis capabilities. Contents: Chapter 1 Introduction 1.1 Symbolic Logic and Computer Science 1.2 Britannica structure Chapter 2 collection set of basic concepts of relations and functions 2.1 2.2 collection Cartesian product 2.3 relationship 2.3.1 binary relation defined 2.3.2 two yuan countable basic concepts countable set of Chapter 3 of the significance of the function of the relationship between the computing basic features of 2.3.3 binary relations function definition 2.4 function 2.4.1 2.4.2 2.4.3 Special function class exercises 3.1 3.2 collection structure the the countability 3.3 uncountability Exercises Chapter Turing computability can do of computable 4.2 Turing Computability 4.3 Turing machine example. 4.1. 4.4 Turing machine. a variety of methods 4.4.1 state diagram notation 4.4.2 The state transition table method 4.4.3 tuple method as defined in 4.5 pairs 4.2 further discuss the existence of 4.6 can not be counted 4.6.1 Turing not computable function 4.6.2 diagonal function constructed 4.6.3 4.6.4 shutdown function Turing downtime function can not be calculated direct proof of Turing thesis 4.7 Universal Turing Machine Problem 5 abacus abacus machine definition computability 5.1 5.2 abacus machine example program 5.3 abacus computability 5.4 abacus machine compiled as a Turing machine 5.4.1 abacus memory 5.4.2 abacus machine program compile exercises to bring reading and writing recursive functions computability 6.1 in Chapter 6. the introduction of recursive functions 6.2 Basic functions 6.3 recursive operator 6.3 .1 composite operator 6.3.2 primitive recursive operator 6.4 recursive functions and functional programming design 6.5 general recursive operator 6.6 recursive function definition 6.7 the recursive function compile abacus machine 6.7.1 Basic function compile 6.7.2 Cn compilation. recursive functions and recursive relationship of Cn [f. g1. g1]. for example 6.7.3 Pr compile 6.7.4 Mn compiled exercises Chapter 7 7.1 recursive sets and recursive relations program of 7.2 based on recursive sets and recursive relationships design 7.3 semi-recursive collection of semi-recursive relations equivalence between different computing model 7.4 Summary Exercises Chapter 8 8.1 to read and write with the said action indicates 8.3 8.2 Turing machine Turing machine program said 8.4 Turing machine configuration and implementation process said that the construction of the 8.5 Turing. Seller Inventory # NE003984

Contact seller

Buy New

US$ 66.17
Convert currency
Shipping: US$ 15.00
From China to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket