Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
COMPUTABILITY AND COMPLEXITY G. N. ARZHANTSEVA AND J. ROLIM
 

Summary: COMPUTABILITY AND COMPLEXITY
G. N. ARZHANTSEVA AND J. ROLIM
Abstract. One of the most critical question about a problem in
computer science is whether we are capable of solving it or even
worse whether this problem admits a solution or not. The theo­
ries of computability and complexity, which are introduced in this
module, have been developed in order to render such questions pre­
cise and to discuss them. In complexity theory, the objective is to
classify problems as easy and hard ones, whereas in computability
theory, problems are classified as solvable and non­solvable ones. In
addition, computability theory introduces several of the concepts
used in complexity theory. Therefore, this module proposes the
integrated study of specific basic issues in both computability and
complexity theory, such as the Church­Turing thesis, decidability
and reducibility, time and space complexity classes, determinism
and non­determinism, hierarchy theorems and polynomial classes
(P, NP, PSPACE, etc.), completeness and basic NP­hard problems.
University of Geneva, Centre Universitaire d'Informatique, 24, rue
General Dufour, 1211 Gen‘ eve 4, Switzerland
E­mail address: {arjantse,rolim}@cui.unige.ch

  

Source: Arzhantseva, Goulnara N. - Section de Mathématiques, Université de Genève

 

Collections: Mathematics