Posted by: Alexandre Borovik | July 24, 2009

Right question

An example of a right question, from Martin Hyland:

Kleene’s Theorem: Fix a finite alphabet \Sigma. The languages recognised by a finite automaton over \Sigma are exactly the regular languages.

WHY???

WHY IS IT INTUITIVELY OBVIOUS?

About these ads

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

Follow

Get every new post delivered to your Inbox.

Join 83 other followers

%d bloggers like this: