Background
Jones, Neil Deaton was born on March 22, 1941 in Centralia, Illinois, United States. Son of Neil Haddon Jones and Serma Udine (Deaton) Ray.
(This volume contains 15 papers from research areas where ...)
This volume contains 15 papers from research areas where Japanese theoretical computer science is particularly strong. Many are about logic, and its realization and applications to computer science; others concern synthesis, transformation and implementation of programming languages, and complexity and coding theory. Not coincidentally, all the authors are either former students or close colleagues of Satoru Takasu, professor and director at the Research Institute of Mathematical Sciences at the University of Kyoto. The purpose of this volume is to celebrate Professor Takasu's influence on theoretical computer science in Japan and worldwide by his research, his philosophy, and his advising of students. The breadth, depth and quality of the papers are characteristic of his interests and activities.
http://www.amazon.com/gp/product/0387579354/?tag=2022091-20
( Computability and complexity theory should be of centra...)
Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impenetrability. Neil Jones's goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. In a shift away from the Turing machine- and Gödel number-oriented classical approaches, Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists and more applicable to practical programming problems. According to Jones, the fields of computability and complexity theory, as well as programming languages and semantics, have a great deal to offer each other. Computability and complexity theory have a breadth, depth, and generality not often seen in programming languages. The programming language community, meanwhile, has a firm grasp of algorithm design, presentation, and implementation. In addition, programming languages sometimes provide computational models that are more realistic in certain crucial aspects than traditional models. New results in the book include a proof that constant time factors do matter for its programming-oriented model of computation. (In contrast, Turing machines have a counterintuitive "constant speedup" property: that almost any program can be made to run faster, by any amount. Its proof involves techniques irrelevant to practice.) Further results include simple characterizations in programming terms of the central complexity classes PTIME and LOGSPACE, and a new approach to complete problems for NLOGSPACE, PTIME, NPTIME, and PSPACE, uniformly based on Boolean programs. Foundations of Computing series
http://www.amazon.com/gp/product/0262100649/?tag=2022091-20
(Partial evaluation reconciles generality with efficiency ...)
Partial evaluation reconciles generality with efficiency by providing automatic specialization and optimization of programs. Proceeding from a gentle introduction for reaching state-of-the-art techniques, this book covers the entire field of partial evaluation. It provides simple and complete algorithms and demonstrates, via examples, that specialization can increase efficiency considerably. This book is intended for final year undergraduate and postgraduate courses in advanced programming languages, partial evaluation and program transformation.
http://www.amazon.com/gp/product/0130202495/?tag=2022091-20
(This book introduces the major concepts, constructions, a...)
This book introduces the major concepts, constructions, and theorems of the elementary theory of computability of recursive functions. It emphasizes the concept of "effective process" early in order to provide a clear, intuitive understanding of effective computability (as related to functions and sets) before proceeding to the rigorous portion of the book. Subsequent chapters present a formal development of the equivalence of Turing machine computability, enumerability, and decidability with other formulations of the concepts, including systems of recursion equations and post's production systems.
http://www.amazon.com/gp/product/0123900506/?tag=2022091-20
Jones, Neil Deaton was born on March 22, 1941 in Centralia, Illinois, United States. Son of Neil Haddon Jones and Serma Udine (Deaton) Ray.
Bachelor of Science in Mathematics, Southern Illinois University, 1962. Master of Science in Mathematics and Computer Science, University Western Ontario, London, Canada, 1965. Doctor of Philosophy in Mathematics and Computer Science, University Western Ontario, London, Canada, 1967.
He is currently Professor Emeritus in computer science at University of Copenhagen. His work spans both programming languages and the theory of computation. Within programming languages he is particularly known for his work on partial evaluation and for pioneering work within both data-flow analysis, control-flow analysis and termination analysis.
Within the theory of computation, he was among the pioneers of the study of Log-space reductions and P-completeness.
He is a 1998 Fellow of the Association for Computing Machinery for "outstanding contributions to semantics-directed compilation, especially partial evaluation, and to the theory of computation, formal models and their practical realization".
(This book introduces the major concepts, constructions, a...)
(Partial evaluation reconciles generality with efficiency ...)
(This volume contains 15 papers from research areas where ...)
( Computability and complexity theory should be of centra...)
Conference organizer and program committee at various universities. Fellow Association for Computing Machinery (editorial board since 1998). Member International Federal Information Proceedings (functional programming since 1990, mathematics foundation programming languages 1986-1992), European Association Programming Languages, European Association Theoretical Company Science, Academy Europaea, Knight of Dannebrog Order (Denmark).
Married Shirley Irene Twente, February 24, 1961 (divorced March 1978). Children: Warren Russell, Melanie Eva, Katherine Laura. Married Lene Lise Rold, January 10, 1981.