• Pre MA-502

  Introduction

  Computable functions and Turing machines. Primitive recursive functions, recursive functions, loop-programs, and while-programs. Decidability, solvability, and unsolvable problems. High complexity classes and reducibilities, hardness, and completeness. The arithmetical hierarchy and definability. The connection to complexity theory is emphasized throughout the course.

Teacher

David Pfeffer
ADJUNCT PROFESSOR

Email: dpfeffer@stevens.edu

Education

Bachelors of Science in Computer Science
Stevens Institute of Technology
Hoboken, NJ
Honors; Minor in Law and Public Policy
Masters of Science in Computer Science
Stevens Institute of Technology
Hoboken, NJ
4.0 GPA; Graduate Certificates in Computer Systems, Databases & Service Oriented Architecture, Distributed Systems, Enterprise Computing, Quantitative Software Engineering, Service Oriented Computing
Professional Societies
Member of the IEEE Computer Society and ACM.
Courses
CS 521 TCP/IP Networking
CS 570 Introduction to Programming, Data Structures, and Algorithms
CS 465 Selected Topics in Computer Science
SSW 810 Selected Topics in Systems Centric Software Engineering