Faculty Profile

John MacCormick

Associate Professor of Computer Science (2007)

Contact Information

jmac@dickinson.edu

Tome Scientific Building Room 242
717.245.1626
http://users.dickinson.edu/~jmac

Bio

John MacCormick has degrees in mathematics from the University of Cambridge and the University of Auckland, and a doctorate in computer vision from the University of Oxford. He was a research fellow at Linacre College, Oxford from 1999-2000, a research scientist at HP Labs from 2000-2003, and a computer scientist with Microsoft Research from 2003-2007. Professor MacCormick joined the faculty of the Department of Mathematics and Computer Science at Dickinson College in Fall 2007. He is the author of two books (Stochastic Algorithms for Visual Tracking, and Nine Algorithms That Changed the Future: The Ingenious Ideas That Drive Today's Computers), has filed over a dozen US patents on novel computer technologies, and is the author of numerous peer-reviewed academic conference and journal papers. His work spans several sub-fields of computer science, including computer vision, large-scale distributed systems, computer science education, and the public understanding of computer science.

Education

  • B.A., University of Cambridge, 1993
  • M.S., University of Auckland, 1996
  • Ph.D., University of Oxford, 2000

2016-2017 Academic Year

Fall 2016

COMP 251 Computer Organization
Completion of both COMP 251 and COMP 332 fulfills the WID Requirement.

COMP 364 Artificial Intelligence
A survey of techniques for applying computers to tasks usually considered to require human intelligence. Topics include knowledge representation and reasoning, search and constraint satisfaction, evolutionary and genetic algorithms, machine learning, neural networks, and philosophical questions. Prerequisites: 232 and MATH 211. Offered in even numbered fall semesters.

Spring 2017

COMP 314 Theoretical Found of Comp Sci
An introduction to the theory of computation. Topics include formal language theory (grammars, languages, and automata including Turing machines), and an introduction to the concept of undecidable problems, including the halting problem. Prerequisites: 132 and MATH 211. This course is cross-listed as MATH 314. Offered every spring.

MATH 314 Theoretical Found of Comp Sci
An introduction to the theory of computation. Topics include formal language theory (grammars, languages, and automata including Turing machines), and an introduction to the concept of undecidable problems, including the halting problem. Prerequisite: COMP 132 and MATH 211. This course is cross-listed as COMP 314. Offered every spring.

COMP 492 Spring Senior Seminar
A continuation of the project begun in 491 culminating in a written thesis and public presentation. Additional contemporary issues in computer science may be considered. Prerequisite: 491. Offered every spring.