CompSciWeek4
From Predictive Chemistry
Revision as of 11:11, 1 September 2014 by David M. Rogers (talk | contribs) (Created page with "= Reading Assignment = * Algorithms, Chapter 2-3 = Class 1: Formal Proofs = * Complexity Notation * Rules - state assumptions, use logical operations on assumptions * Modus Pone…")
Contents
Reading Assignment
- Algorithms, Chapter 2-3
Class 1: Formal Proofs
- Complexity Notation
- Rules - state assumptions, use logical operations on assumptions
- Modus Ponens - (a, a =>b) => b
- Modus Tollens - [(a ^ b), ~a] => b
- Contradiction - (a, ~a) => Yikes!
ex. from 1+1 = 1, prove that I am the Pope. A: The Pope and I make 2, but 1+1 = 1, so I and the Pope are one and the same.
- Anything that proves a false statement is false.
- If a then False => ~a
- Induction
Class 2: Using HPC Resources
- accessing binaries and libraries, using modules
- using scratch space
- submitting a job script
- managing queued jobs
- advanced scripting tips and tricks
Homework 3 - due Monday, Sept. 22
- Check back later for problems