Skip to content

Convergence Theorem for Programming Languages

July 1, 2014

Let L = the LISP language. Let P = a programming language different from L, i.e. L \cap P = \oslash. Let t = time. Then \lim_{t \to \infty} P = L.

Proof:
Trivial, just look at the extensions they are making on Python, Ruby, Java, C# and C++11.

Hehe.

Advertisements
2 Comments leave one →
  1. Valentin permalink
    July 31, 2015 3:38 pm

    Hm, to express that L is different from P it would be more appropriate to state that the set difference of L and P is not empty instead of stating an empty intersection. Furthermore I’m quite sure that no extensions are being done on C++11 šŸ™‚

    • July 31, 2015 3:47 pm

      Thanks Valentin.

      You have a point, but I am proving the strong case šŸ™‚

      LPC

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

%d bloggers like this: