Logo
  • Home
  • Classes
  • Conveying Computing
  • Exams
  • Fractal Gallery
  • Guides
  • Problem Sets
  • Syllabus

Class 37: Computability in Theory and Practice

Posted by David Evans on 21 Nov 2011 in Classes, Exams | 2 comments
Class 37: Slides [PPTX]

Exam 2 is available now: [PDF]. Exam 2 is due at the beginning of class on Wednesday, 30 November.

If you prefer to type your answers for Exam 2 (which can include cut-and-pasting from your editor), you may use this Word template: [DOCX]. If you use the template, make sure you do not lose your formatting (including indenting) when you past into the boxes, and do not break the pagination of the exam. Please print the exam using single-sided printing.

Here’s the video on the philosophy of computability from today’s class:

Print Friendly Print Get a PDF version of this webpage PDF

2 Responses to “Class 37: Computability in Theory and Practice”

  1. Cailey says:
    21 November 2011 at 10:39 pm

    The integration of Ali G and “techmology” into the UVA classroom was marvelous today. I think everyone could use a little more Ali G in their lives.

  2. David Evans says:
    28 November 2011 at 10:36 pm

    I have updated the exam to fix the problem described here: Bug in Exam Question.


Fall 2011

Register
Login

Help Schedule

(all in Davis Commons, except Dave's office hours in Rice 507)
Sundays, 1-6pm (Valerie/Joseph/Kristina)
Mondays, noon-1:30pm (Kristina)
Mondays, 1:15-2:00pm (Dave, Rice 507)
Tuesdays, 11am-noon (Dave, Rice 507)
Tuesdays, 5-8pm (Valerie/Jonathan)
Wednesdays, 5-6:30pm (Jiamin)
Thursdays, 9:45-11am (Dave, Rice 507)
Thursdays, 1-2:30pm (Joseph)
Thursdays, 4:30-7:30pm (Jonathan/Jiamin)
Fridays, noon-1:30pm (Peter)

Recent Posts

  • Course Wrap-Up
  • Class 41: The Cake of Computing
  • PS8 Submissions
  • Class 40: GuardRails, Big Data, and Secure Computation
  • Exam 2 Solutions

Recent Comments

  • David Evans on Problem Sets
  • jacob777 on Problem Sets
  • Prof. K.R. Chowdhary on Class 41: The Cake of Computing
  • Anon on Exams
  • Anon on Exams

Index

  • Classes
    • Class 1: Computing
    • Class 2: Language
    • Class 3: Rules of Evaluation
    • Class 4: Constructing Procedures
    • Class 5: Procedures Practice
    • Class 6: Programming with Data
    • Class 7: Programming with Lists
    • Class 8: Recursive List Procedures
    • Class 9: Consistent Hashing
  • Conveying Computing
  • Exams
  • Fractal Gallery
  • Guides
    • DrRacket Guide
    • Schemer’s Guide to Python
  • Problem Sets
    • Problem Set 0: Course Registration, Racket
    • Problem Set 1: Making Mosaics
      • PS1 Comments
    • Problem Set 2: Sequence Alignment
      • PS2 Comments
    • Problem Set 3: Limning L-System Fractals
      • PS3 – Comments
    • Problem Set 4: Constructing Colossi
      • PS4 – Comments
    • Problem Set 5: Wahoo! Auctions
      • PS5 Comments
    • Problem Set 6: Adventures in Charlottansville
      • PS6 Comments
    • Problem Set 7: Charming Snakes with Mesmerizing Memoizers
      • PS7 Comments
      • PS7 Responses
    • Problem Set 8 (Part 2): Typed Aazda
    • Problem Set 8: From Aazda to aaZda (Part 1)
      • PS8 Part 1 Comments
  • Syllabus
    • Course Pledge
  • Using These Materials

RSS BA Computer Science

RSS Jefferson’s Wheel

  • Dissecting Distribution Inference
  • Cray Distinguished Speaker: On Leaky Models and Unintended Inferences
  • Attribute Inference attacks are really Imputation
  • Congratulations, Dr. Jayaraman!

RSS Hacker News

  • Russhian Roulette: 1/6 chance of posting your SSH private key on pastebin
  • Diff Models – A New Way to Edit Code
  • Detect ChatGPT Generated Content
  • Kotlin Data Classes 101: Understanding Syntax, Usage and Inheritance
  • 30k lines of SwiftUI in production later

RSS Babbage

  • And it’s goodnight from us
  • Why 10, not 9, is better than 8
  • Future, imperfect and tense
  • The paperless dilemma
  • How to judge a ’bot; why it’s covered
cs1120 | RSS | Comments RSS | Book | Using These Materials | Login | Admin | Powered by Wordpress