Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Last revision Both sides next revision
people:mlsmith:top [2020/07/29 22:11]
mlsmith [Quotes]
people:mlsmith:top [2024/01/14 23:24]
mlsmith
Line 1: Line 1:
 =====  Marc L. Smith ===== =====  Marc L. Smith =====
-**Associate Professor**\\ +//(he/him)// \\ 
 +**Associate Professor and Chair**\\ 
 <html><a style="font-weight: bold;" href="http://computerscience.vassar.edu/"> Computer Science Department</a></html>\\ <html><a style="font-weight: bold;" href="http://computerscience.vassar.edu/"> Computer Science Department</a></html>\\
 <html><a style="font-weight: bold;" href="http://www.vassar.edu">Vassar College</a></html> <html><a style="font-weight: bold;" href="http://www.vassar.edu">Vassar College</a></html>
Line 8: Line 9:
 ==== Coordinates ==== ==== Coordinates ====
  
-| **Office:** SP 104.5 \\ **Voice:** 845 437 7497\\ **E-mail:** mlsmith@vassar.edu | | Vassar College, Box 399\\ 124 Raymond Avenue\\ Poughkeepsie, NY 12604-0399 | +| **Office:** SP 104.5 \\ **Voice:** 845 437 7497   [[https://vassar.zoom.us/j/8904060254?pwd=ZGN2OEdPNEpvMUVFTlphT0xSRk5jQT09|Zoom]]\\ **E-mail:** mlsmith@vassar.edu    | Vassar College, Box 399\\ 124 Raymond Avenue\\ Poughkeepsie, NY 12604-0399  |
  
-==== Fall 2020 ====+==== Spring 2024 ====
  
-  * CMPU-377Parallel Programming +  * <html><a style="font-weight: bold;" href="https://www.cs.vassar.edu/~mlsmith/cs101/52"> CMPU-101Problem-Solving and Abstraction</a></html>\\ 
-    * Lectures: Mon/Wed 12:00--1:15pm \\ \\  +    * Lectures: Mon/Wed 9:00am--10:15am  
-  * CMPU-381: Relational Databases and SQL +    * LabsFri 9:00am--11:00am \\ \\  
-    * LecturesMon 3:10--5:10pm \\ \\  + 
-  * Office hours:  +  * Office hours:   
-    * tbd //and by appointment//+    * In person (and [[https://vassar.zoom.us/j/8904060254?pwd=ZGN2OEdPNEpvMUVFTlphT0xSRk5jQT09|Zoom]] by appointment) 
 +    * Mon/Wed 10:30am--12:00pm in SP 104.5  (tentative) 
 +    * //and by appointment// 
  
 /**** /****
-  * CMPU-101[[courses:cs101-201902:top|Problem-Solving and Abstraction]] +  * CMPU-377Parallel Programming 
-    * Lectures: Mon/Wed 1:30-2:45pm +    * Lectures: Mon/Wed 12:00--1:15pm (remote) \\ \\  
-    * LabsFri 1-3pm +  * CMPU-311Database Systems 
-    * SP 309+    * LecturesMon 3:10--5:10pm \\ \\  
 +  * [[https://moodle.vassar.edu/course/view.php?id=25594|BIOL/CMPU-353: Bioinformatics]] 
 +    * Lectures: Tue/Thu 1:00--3:00pm \\ \\ 
 ****/ ****/
 +
  
 ==== Research Interests ==== ==== Research Interests ====
Line 46: Line 52:
 //Controlling complexity is the essence of computer programming.// --Brian Kernighan //Controlling complexity is the essence of computer programming.// --Brian Kernighan
  
-//There are two ways of constructing a software design: one way is to make it so simple that there are __obviously__ no deficiences and the other way is to make it so complicated that there are no __obvious__ deficiencies.// --C.A.R. Hoare (The emperor's old clothes - 1981)+//There are two ways of constructing a software design: one way is to make it so simple that there are __obviously__ no deficiences and the other way is to make it so complicated that there are no __obvious__ deficiencies. The first method is far more difficult.// --C.A.R. Hoare (The emperor's old clothes - 1981) 
 + 
 +//Simplicity is a great virtue but it requires hard work to achieve it and education to appreciate it. And to make matters worse: complexity sells better.// --Edsger Dijkstra
  
 //SQL, Lisp, and Haskell are the only programming languages that I've seen where one spends more time thinking than typing.// --Philip Greenspun //SQL, Lisp, and Haskell are the only programming languages that I've seen where one spends more time thinking than typing.// --Philip Greenspun
  
 +//If you give someone Fortran, he has Fortran. If you give someone Lisp, he has any language he pleases.// --Guy L. Steele, Jr.
 +
 +//Do the best you can until you know better. Then when you know better, do better.//
 +--Maya Angelou
 +
 +/*
 <code>(( λ (x) (x x)) ( λ (x) (x x)))</code> \\ <code>(( λ (x) (x x)) ( λ (x) (x x)))</code> \\
 +*/
  
 +$((\lambda(x)\ (x\ x))\ (\lambda(x)\ (x\ x)))$