Month: December 2012

My Entrepreneur Ideology

In this day and age, it seems that entrepreneurship is something mainstream. Everybody is saying they want to be an entrepreneur – just because it was popular. Well, I want to say that I was an entrepreneur before it got popular.  I’d like to talk about the traits to become an entrepreneur. I shall explore into how the thinking process of a true entrepreneur differs from that of wannabes. I consider myself a true entrepreneur, and not a wannabe. I will attempt to list out the traits I think that would make me a true entrepreneur, and then describe and recollect my related experiences with that aspect.

My ideology is that you need to have a grand goal to work towards to in life.

  1. One must be ready for an adventure. And this concludes the first trait of an entrepreneur. You must be up for an adventure. There isn’t a straight path to getting something you want. I think it’s most important for one to have a focus and general target. Then work towards that target in any method or path possible. With a target and determination (and lots of elbow grease), one can attain the goals.

    2. Continue reading My Entrepreneur Ideology

Arduino

Playing around with an Arduino today, programmed it to count down. Very simple, I know, but it is just introduction to the usage.
This article is not meant to be a tutorial. It is to remind myself of what I did.

The arduino programming IDE basically just C++ with a different namespace. And a little deviation. You don’t need things like #include , and don’t need a int main(int argc, char** argv) program.

Hardware

 

Continue reading Arduino

CS245 regarding countability decidability

I thought this assignment is really interesting and worth posting about.

CS 245 Assignment 5 Fall 2012

Question 1 (30pt)
Let ti be a term of the form s(· · · s(0) · · ·) that represents a natural number ni written in
unary
(e.g., s(s(s(0))) represents the number 3).

• Form a set of clauses Σ such that Σ r TIMES(t1, t2, t3) whenever n1 · n2 = n3;
• Show a resolution refutation of TIMES(s(s(0), s(0), s(s(0)))) w.r.t. Σ from above;
• Is the set of terms {f (t1, t2, t3) | n1 · n2 = n3} recursive?
Continue reading CS245 regarding countability decidability