Neil Jones' goal as an educator and author is to build bridges between computability and complexity theory and other areas of computer science, especially programming. number-oriented classical approaches, Jones uses the concept of a programming language familiar to computability and complexity make it more accessible by computer scientists and more applicable to practical programming problems. According to Jones, the field of computability theory and complexity, as well as programming languages and semantics, has a lot to offer each other. Computability and complexity theory have broad, deep, and generally not often seen in programming languages. In addition, the programming language can sometimes give a more realistic computational models in certain important aspects from the traditional model. The proof involves the techniques relevant to practice) the results of further including a simple characterization in terms of programming complexity classes PTIME and LOGSPACE center, and new approaches to solve problems for NLOGSPACE, PTIME, NPTIME, and PSPACE, uniforms based on Boolean program ..