how hard can it be?
algorithms:
- what can they do?
- what can’t they do?
Saturday, 3 December 2011
regular expressions any character is a regexp Kleene * matches - - PowerPoint PPT Presentation
how hard can it be? algorithms: what can they do? what cant they do? Saturday, 3 December 2011 regular expressions any character is a regexp Kleene * matches itself if R and S are regexps, so is RS matches a
Saturday, 3 December 2011
a match for R followed by a match for S
any match for R or S (or both)
any sequence of 0 or more matches for R
Stephen Kleene 1909-1994
Kleene *
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
if your potatoes are large
Saturday, 3 December 2011
form stiff peaks
Saturday, 3 December 2011
the bowl
Saturday, 3 December 2011
flour until you have a stiff dough
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
maze generator
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
Saturday, 3 December 2011
statement B is true
statement A is false
Saturday, 3 December 2011
statement A is false
statement E is true
Escher, Hands
Saturday, 3 December 2011
Albert says "Everything Caroline says is true" Betty says "Everything I say is false" Caroline says "Everything David says is true" David says "Everything Caroline says is false"
Who is the only person who can be telling the truth?
This is a sample question for the Cambridge admissions test for philosophy.
Saturday, 3 December 2011