Advanced Computing Concepts for Engineering (Engi-9867) 2020

Note on notes: I'll update the notes as the course goes along. Announcements of updates will be made on the Front Page.

Background

• BG-0 Outline of the course
• BG-1 Mathematical concepts

Specification and derivation of programs

• 0-0 Behavioural specifications
• 0-1 Input, output and implementability
• 0-2 Imperative transformational programming and programming constructs.
  • Updated slides: 2017.Jan.25 in the afternoon.
• 0-3 Derivation of programs
  • Update slides: 2017.Jan.30 in the afternoon. Added more examples. Fixed summation example.
• 0-4 More on Iteration
• 0-5 More examples of Iteration
• 0-6 Loop invariants
• 0-6a More on loop invariants
• 0-7 The maximum segment sum
• 0-8 Further applications of specifications and derivation of programs

Models of computation

• 1-0 Overview
• 1-1 Strings, languages, and regular expressions(Updated 2020. Feb.18)
• 1-2 Finite recognizers(Updated 2018.Feb.27)
  • Example of converting an NDFR to a DFR.
  • Typo: If you printed these slides before 2018.Feb.27, please make the following corrections:  On pages 14 and 16 (or 17) change "w = ([a];s)" to "w = [a]^s".
• 1-3 Reactive Systems
• 1-4 Context Free Grammars and Lanugages
  • Updated 2018 March 13.
    • Page 40. Last word should be "production"
    • Pages 43--52. This section was rewritten and expanded. If you printed the notes before, you should reprint these pages.
• 1-5 Turing machines, undecidability, and universality.
  • Extra notes on the Halting Problem in Java.
  • A Turing machine using film leader for tape (video).
  • A wooden Turing machine. (video)
  • Scooping the Loop Snooper, a poem by Geoffrey Pullman in the style of Dr. Seuss.

Efficiency of computation

• 2.0 Time complexity of algorithms
• 2.1 Some examples
• 2.2 Time complexity of problems and lower bounds
• 2.3 Tractable, intractable, and seemingling intractable problems.

(c) Theodore Norvell