Wednesday, April 8, 2009

Weather Update

Winter is always a weird season for me. The daily shrinking amount of sunlight to be had always brings about a similar reaction inside me where I express less and less about what I am thinking. I no longer find this as bad as I used to, just a different mode.

I've been working on a lot of side projects lately, most of which I will end up finishing soon. I hope to document those here and on a more organized site I will make for that purpose. It's exciting to finish these projects up because they represent some solid results of an ongoing project I have been trying to implement in my life, that is really take advantage of the time I have and the skills and actually make something. Contrast that to my usual habit of learning about something on the side but never producing any definite output. It just requires a smarter approach.

Thing I want to do in the upcoming months:

  1. Retake my GRE so it is up to date. Take the Math GRE subject test.
  2. Keep developing applications that solve problems interesting to me but help others too. Attend the Google I/O conference.
  3. Begin contributing regularly to an open source project!
  4. Build more skate-able stuff and keep skating a lot.
  5. Enjoy my time out of school.
Anyhow, living in LA is still a blast. I no longer have a car but that's actually pretty cool too, I ride my bike a lot.

Keep your eyes on http://www.j-o-h-n-s-o-n.com for the latest in Wilde fashion.

Tuesday, October 7, 2008

A Pretty Good Night in Echo Park

1.) Leave work early because I can.

2.) Drive around Hollywood to run errands. Passport photos/Send brother birthday skateboard. Check.

2.) Get home, skate down to Sunset and skate around for a while.

3.) Find one of those banned bacon-wrapped hot dog dealers (score!). Buy a beer and rejoice.

4.) Get ready for work travel tomorrow, side project time. Good night.




Speakin' of the G's I be holdin', picture me rollin'

Sunday, October 5, 2008

I Am A Programming Nerd

Pascal's Triangle parity only random colored.

Thursday, August 21, 2008

Theory of Computation: The Halting Problem

Certain things cannot be known about any algorithm or effective procedure. For example, let's say we wrote an algorithm together.

First we give that algorithm some input, maybe a finite number of integers:

x1, x2, x3, ..., xn

Now our algorithm is going to do something with these integers in a finite number of steps and give us a result. Maybe it will sort them by largest to smallest and print them out in that order: the key here is that the algorithm does things with the inputs in a specified order and with specified instructions on how to handle certain instructions. For example the algorithm probably needs to compare two integers and see which one of them is larger, that is evaluate the expression:

a > b

and then do something with it. A common notation for that is:

if ( a > b )

{

do stuff;

...

}



where "do stuff" stands for a set of instructions. The algorithm is also allowed to do things on a repetitive basis using logic such as

while ( a > b )

{

do stuff;

...

}



So we have conditional branches (if statements) and conditional loops (while statements). There are a few more possibilities but at this point we have enough expressiveness in our language to warrant the following conjecture:

Given any algorithm A(x1, x2, x3, ..., xn) with finitely many finite inputs there is no generic algorithm that can be written to determine whether or not A will ever halt.

That is we can never determine if our algorithm will finish the job we gave it, and so we call such a problem undecidable. It turns out that a lot of interesting problems are provably undecidable, which has stunned computer scientists and mathematicians for almost a century now. There was a time when mathematicians -- first and foremost among them David Hilbert -- thought that the idea of an undecidable problem was fictitious. Gödel then proved that any computational language that can do simple arithmetic (i.e. add and multiply natural numbers) has undecidable propositions, so while they may have a definite value there is absolutely no way to show it in a finite number of steps. That result is now called Gödel's Incompleteness Theorem and it has forever changed human ideas in mathematics. A more specific version of his theorem goes like this (from Wikipedia):

Any effectively generated theory capable of expressing elementary arithmetic cannot be both *consistent and complete. In particular, for any consistent, effectively generated formal theory that proves certain basic arithmetic truths, there is an arithmetical statement that is true, but not provable in the theory.

*Consistency means that no statement in the language can be both true and not true.


While Gödel's incompleteness theorem sounds scary, it is by no means the end of computability theory. In fact it was only the start; the techniques and ideas invented to prove the incompleteness theorem led to a cascade of ideas that is now modern computability theory. The Church-Turing thesis and the lambda calculus are a good next stop.

Beer is Nighttime Water

Am I right?

Tuesday, July 29, 2008

Baby's First Earthquake

I didn't have to wait long for an earthquake, just three months. It was actually pretty cool. They originally said it was a 5.8 but now it seems the average is a 5.4. I'm near the top floor of my building so there was quite a bit of swaying and my desk chair rolled me around a bit. I have to admit that in the first few seconds I was a little frightened that it was just the beginning of a more massive quake, but no one else seemed too afraid so I just enjoyed it. A nice beginner earthquake.

If you don't got the data that chatta don't matta: Earthquake Data

Monday, July 14, 2008

Obscurity is the best camouflage, nuclear power has had its hour.

I get a lot of spam. I'm sure you do too.

Every once in a while I wonder where all that text at the bottom of spam mails is found. It seems obvious that it is pulled across the internet from random places or from phrase files stored on the spammer's machine. I was surprised when I ran a search and found that someone's semantics and language study website is actually being raped in the name of bypassing spam filters with valid phrases. The website I found is simply a long list of various neologisms delimited with '/' characters. I assume the neologisms were generated with some algorithm which searches a dictionary for nouns and verbs fitting some clever semantic rules. It's funny to see that the automated generation of meaningful phrases has been in turn used to trick a filter designed to exclude non-meaning, and this has probably been the most major use of that project to date.

Here are those neologisms.


P.S. Never kiss a gift whore in the mouth.
 
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 United States License.