Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Generalization Of Some Concepts Of Complexity Theory In Structures

 

Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

 
Rs. 2,675

Availability: In stock

 
  • Product Description
 

This work includes two parts. The first part of the work is about a particular computably enumerable sets (c.e. sets). It includes a novel generalization of an immediate result of Rogers' fixed point Theorem. The second part of this work answers a question raised by B. Poizat. The classical theory of computation was started by the works of Gödel, Turing and Church around 1930. They are pioneers of the aspect of computing called "classical recursion theory". Later, Mathematicians became concerned with some restrictions, especially on "space" and "time". This leaded to «complexity theory". This area still has many unsolved roblems, the most interesting one is the great problem: "P=NP". In 1989 Lenor Blum, Mike Shub and Steve Smale tried to generalize the concept of "algorithm" to "real number algorithm". Based on their work, B. Poizat generalized the classes of P and NP for arbitrary models. One of the main questions in this area is to find a model in which "P=NP" is true. In this work, we will give the answer positively.

Product Specifications
SKU :COC76233
AuthorFarzad Didehvar
LanguageEnglish
BindingPaperback
Number of Pages76
Publishing Year2014-08-05T00:00:00.000
ISBN9783659344992
Edition1 st
Book TypeMathematics
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-10-08 00:00:00