|
Showing 1 - 2 of
2 matches in All Departments
Among the most important problems confronting computer science is
that of developing a paradigm appropriate to the discipline.
Proponents of formal methods - such as John McCarthy, C.A.R. Hoare,
and Edgar Dijkstra - have advanced the position that computing is a
mathematical activity and that computer science should model itself
after mathematics. Opponents of formal methods - by contrast,
suggest that programming is the activity which is fundamental to
computer science and that there are important differences that
distinguish it from mathematics, which therefore cannot provide a
suitable paradigm. Disagreement over the place of formal methods in
computer science has recently arisen in the form of renewed
interest in the nature and capacity of program verification as a
method for establishing the reliability of software systems. A
paper that appeared in Communications of the ACM entitled, Program
Verification: The Very Idea', by James H. Fetzer triggered an
extended debate that has been discussed in several journals and
that has endured for several years, engaging the interest of
computer scientists (both theoretical and applied) and of other
thinkers from a wide range of backgrounds who want to understand
computer science as a domain of inquiry. The editors of this
collection have brought together many of the most interesting and
important studies that contribute to answering questions about the
nature and the limits of computer science. These include early
papers advocating the mathematical paradigm by McCarthy, Naur, R.
Floyd, and Hoare (in Part I), others that elaborate the paradigm by
Hoare, Meyer, Naur, and Scherlis and Scott (in Part II),
challenges, limits and alternatives explored by C. Floyd, Smith,
Blum, and Naur (in Part III), and recent work focusing on formal
verification by DeMillo, Lipton, and Perlis, Fetzer, Cohn, and
Colburn (in Part IV). It provides essential resources for further
study. This volume will appeal to scientists, philosophers, and
laypersons who want to understand the theoretical foundations of
computer science and be appropriately positioned to evaluate the
scope and limits of the discipline.
Among the most important problems confronting computer science is
that of developing a paradigm appropriate to the discipline.
Proponents of formal methods - such as John McCarthy, C.A.R. Hoare,
and Edgar Dijkstra - have advanced the position that computing is a
mathematical activity and that computer science should model itself
after mathematics. Opponents of formal methods - by contrast,
suggest that programming is the activity which is fundamental to
computer science and that there are important differences that
distinguish it from mathematics, which therefore cannot provide a
suitable paradigm. Disagreement over the place of formal methods in
computer science has recently arisen in the form of renewed
interest in the nature and capacity of program verification as a
method for establishing the reliability of software systems. A
paper that appeared in Communications of the ACM entitled, Program
Verification: The Very Idea', by James H. Fetzer triggered an
extended debate that has been discussed in several journals and
that has endured for several years, engaging the interest of
computer scientists (both theoretical and applied) and of other
thinkers from a wide range of backgrounds who want to understand
computer science as a domain of inquiry. The editors of this
collection have brought together many of the most interesting and
important studies that contribute to answering questions about the
nature and the limits of computer science. These include early
papers advocating the mathematical paradigm by McCarthy, Naur, R.
Floyd, and Hoare (in Part I), others that elaborate the paradigm by
Hoare, Meyer, Naur, and Scherlis and Scott (in Part II),
challenges, limits and alternatives explored by C. Floyd, Smith,
Blum, and Naur (in Part III), and recent work focusing on formal
verification by DeMillo, Lipton, and Perlis, Fetzer, Cohn, and
Colburn (in Part IV). It provides essential resources for further
study. This volume will appeal to scientists, philosophers, and
laypersons who want to understand the theoretical foundations of
computer science and be appropriately positioned to evaluate the
scope and limits of the discipline.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|