Calendar

Apr
23
Tue
6.2
Apr 23 @ 9:00 am – 10:00 am
Apr
25
Thu
6.2: Doughnut volume
Apr 25 @ 9:00 am – 10:00 am
Apr
30
Tue
Final from Spring 2012
Apr 30 @ 9:00 am – 10:00 am
Jan
14
Tue
1.1-1.2 Class of regular languages closed under union
Jan 14 @ 1:30 pm – 2:45 pm
Jan
21
Tue
NFA=DFA=regex
Jan 21 @ 1:30 pm – Jan 21 @ 2:30 pm
Jan
23
Thu
Automatic complexity
Jan 23 @ 1:30 pm – Jan 23 @ 2:30 pm
Jan
28
Tue
3.1 (Turing machines)
Jan 28 @ 1:30 pm – Jan 28 @ 2:30 pm
Mar
10
Mon
Probability seminar: Malihe Alikhani @ Keller 414
Mar 10 @ 1:30 pm – Mar 10 @ 2:30 pm

Speaker: Malihe Alikhani
Title: The longest run of heads and tails
Abstract: The distribution of the longest run of heads or tails in a coin flip sequence will be discussed, along with possible strategies for trying to stop at approximately the end of a longest run.

Mar
19
Wed
Computability Seminar: P vs. NP @ Keller 404
Mar 19 @ 1:30 pm – Mar 19 @ 2:30 pm

Speaker: Bjørn Kjos-Hanssen
Abstract: I will just explain what this famous problem is all about and probably draw some Turing machines on the board. This is part of Math 480 (senior seminar) but open to other attendees.

Mar
21
Fri
Computability seminar: Paul Nguyen @ Keller 414
Mar 21 @ 1:30 pm – Mar 21 @ 2:30 pm

Title: Subdirectly irreducible algebras and $\Sigma^0_3$-completeness

Apr
8
Tue
K-Complexity (6.4)
Apr 8 @ 1:30 pm – Apr 8 @ 2:30 pm
Apr
10
Thu
BPP and primality (10.2) @ P vs. practical algorithms
Apr 10 @ 1:30 pm – Apr 10 @ 2:30 pm
Apr
11
Fri
Computability seminar: Paul Nguyen @ Keller 414
Apr 11 @ 1:30 pm – Apr 11 @ 2:30 pm

The $\Sigma^0_3$-completeness of the problem of subdirect irreducibility of an algebra.

Apr
15
Tue
gcd(411,561)=3>1
Apr 15 @ 1:30 pm – Apr 15 @ 2:30 pm
Apr
17
Thu
Computability seminar: Dusko Pavlovic @ Keller 401
Apr 17 @ 1:30 pm – Apr 17 @ 2:45 pm

Title: Monoidal Computer

Apr
22
Tue
Page rank
Apr 22 @ 1:30 pm – Apr 22 @ 2:30 pm
Apr
28
Mon
Probability seminar: Malihe Alikhani @ Keller 402
Apr 28 @ 11:30 am – 12:30 pm
Apr
29
Tue
Fetherolf: Primality testing
Apr 29 @ 1:30 pm – Apr 29 @ 2:05 pm
Chambers: Automatic complexity of pairs
Apr 29 @ 2:10 pm – 2:45 pm
May
1
Thu
Webb: Büchi automata
May 1 @ 1:30 pm – May 1 @ 2:05 pm
Mohamed: Monoidal computer
May 1 @ 2:10 pm – 2:45 pm
May
6
Tue
Rosa: Hypercube complexity
May 6 @ 2:10 pm – 2:45 pm
Jul
9
Wed
Constructive math and type theory, with a Coq demo @ Keller Hall 314
Jul 9 @ 1:00 pm – Jul 9 @ 2:00 pm

Speaker: William DeMeo (Iowa State)
Title: Some constructive math and type theory, with a Coq demo.

Abstract: I will present a few basic ideas from constructive
mathematics and type theory, and give a very basic demonstration of
the Coq proof assistant.

Aug
26
Tue
7.1 @ KELL 302
Aug 26 @ 12:00 pm – 1:15 pm
Aug
27
Wed
nothing due
Aug 27 all-day
Sep
3
Wed
7.1 due
Sep 3 all-day
Sep
10
Wed
7.1 returned
Sep 10 all-day
7.2, 7.3 due
Sep 10 all-day
Sep
17
Wed
7.2, 7.3 returned
Sep 17 all-day
7.4, 7.5 due
Sep 17 all-day