mpla.math.uoa.gr
Font size: Αα Αα Αα hide gadgets
You are here: Teachers » Yiannis N. Moschovakis Anonymously browsing from 54.162.10.211 at 19:34:49, 20-09-2017. login

Yiannis N. Moschovakis

courses given

Course Semester
Μ6. 2008-2009, spring semester
Λ2. 2007-2008, spring semester
Μ6. 2007-2008, spring semester
Λ2. 2006-2007, fall semester
Λ02Α. 2006-2007, fall semester
Λ2. 2005-2006, fall semester
M11. 2005-2006, fall semester
Λ2. 2004-2005, fall semester
Μ6. 2004-2005, fall semester
Λ02Α. 2004-2005, fall semester
Λ2. 2003-2004, fall semester
Μ6. 2003-2004, fall semester
Λ2. 2002-2003, fall semester
Λ02Α. 2002-2003, fall semester
Λ2. 2001-2002, fall semester
Λ01Ν. 2001-2002, fall semester
Λ2. 2000-2001, fall semester
Λ98Ν. 2000-2001, fall semester
Λ99Ν. 1999-2000, spring semester
Λ2. 1999-2000, fall semester
Μ99Δ. 1999-2000, fall semester
Λ2. 1998-1999, fall semester
Λ98Ν. 1998-1999, fall semester
Λ2. 1997-1998, fall semester
M11. 1997-1998, fall semester
Λ2. 1996-1997, spring semester
26 courses.

seminars given

date title
2011/06/24 Horner's rule is optimal for Polynomial 0-testing
2010/10/22 The Axiomatic Derivation Of Absolute Lower Bounds
2010/06/18 Kleene's amazing Second Recursion Theorem
2007/12/14 Axioms for elementary algorithms, and the derivation of absolute lower bounds
2007/06/29 Borel determinacy
2006/10/20 “... (a+bn)/n=x, hence God exists”—with Logic only!
2006/03/24 Recursion and complexity
2005/10/07 Kleene's infamous second recursion
2005/04/01 Recursion and complexity
2004/11/05 Inductive relations
2003/10/03 Is Euclid's algorithm optimal?
2002/11/01 Inductive relations
2001/10/05 The complexity of Euclid's algorithm
2000/10/20 The logic of (complete and partial) equations
2000/02/25 Meanings, algorithms and games
1999/10/15 Three episodes from the history of set theory
1998/10/30 The notion of Algorithm
1998/04/03 Semantics for fair indeterminacy in models of the typed λ-calculus
1997/10/31 Games in Analysis, Logic and Theoretical Computer Science, II
1997/10/24 Games in Analysis, Logic and Theoretical Computer Science, I
1997/06/06 The notion of set, from Cantor to Hilbert
1997/03/21 The meaning of the Church-Turing Thesis
22 seminars.

PhD theses supervised

title student defense
Algorithmic natural language semantics---A study of Locality in the Theory of Referential Intensions Eleni Kalyvianaki 2007-09-01
1 PhD thesis.

MSc theses supervised

title student defense
Recursive algorithms and implementations Vasileios Paschalis 2006-12-01
Bertrand paradoxes and Kolmogorov's foundations of the theory of probability Ch. Anagnostopoulos 2006-10-01
Continued fractions and the subtractive Euclidean algorithm Aggelina Vidali 2005-09-01
Wormhole attacks in wireless networks Nikolaos Kiourtis 2004-10-01
Logical games and Blackwell games Kyriakos Kypriotakis 2002-07-01
The problem of isometry in Polish spaces Alexandros Arvanitakis 2001-12-01
Ramsey theory and applications Anastasios Matzavinos-Toumasis 2001-07-01
Neighbor discovery in satellite networks Dimitrios Tsiounis 2001-07-01
8 MSc theses.

Reporter

Page updates

No recent updates.

Feeds RSS and Atom feeds

posts
all posts RSS
news RSS
announcements RSS
website news RSS
events
all events RSS
defenses RSS
exams RSS
seminars RSS
graduations RSS
Web standards: XHTML1.0, CSS3.
© 1996 – 2017 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.