Skip to main content

Week 4: What the proof?

Hello readers!

Today I would like to talk to you about this week's newest topic: Proofs! (Because I'm sure you've all read enough about how easy or difficult the first assignment was).

Since they have just been introduced to us, I am definitely no expert in the field, however I have to say that this is definitely an art, that is, a very accurate art. To create a proof for a statement takes true creativity and "out-of-the-box" thinking, while having to keep all the parts within it logically valid and true. 

To me, making a proof is like making a burger: you have your standard buns (the outline of the proof) and then you're essentially free to put whatever you want between those buns, as long as it's edible and the flavours are coherent and harmonious. Further, just like how a BLT can't be missing any of those 3 ingredients that make it a BLT, you also can't just take out steps wherever you please. Creating cool new burgers is an art and a science, as in making a proof. While not all burger enthusiasts may be the perfect logicians, I would like to think that most logicians would be able to create a pretty darn good sandwich because they know how to make proofs.

So that's it for this week, I'll let how well my "burgers" turn out in later weeks!

Take care and go flip some burgers!
Lana :)
Labels:

Comments

Post a Comment

Popular posts from this blog

Week 12: Halting Problem Visualized

Hello readers! I'm sure you're all hard at work trying to finish assignment 3. I just wanted to take a few minutes to share with you a video I found on the halting problem. It may be a tad overdramatic (especially with the music) and corny, but it does explain the problem quite well. Here's part 1 (which can be skipped if you want): And part 2, which is where the real explanation of the halting function starts (skip to 2:33 if you don't like corny dialogue): Hopefully this helps with your endeavors (or at least is a bit entertaining)! Good luck with the assignment! Lana :)
Post a Comment
Read more

Week 5: Tracing Recursion

Hello readers! How have you guys been recently? I have been bombarded with a myriad of tests, labs, and assignments, as usual, but I'll holding up alright! Today's blurb is on tracing recursion! As you all know, a recursive function is basically any function that is called within itself. You'll need it any time a bigger problem can be solved by solving smaller versions of a same type of problem until you get your answer to the big one. Kind of. At least that's how I see it. Anyhow, tracing recursion is not as bad as it sounds, it takes some bit of practice, of course, but all in all it will eventually click. Tracing recursion was on the test this week went successfully I should think. The quasi-solution I came out with with involved the function we needed to trace giving the maximum length of any lists that were fed into it, including the length of the overall list. If I am correct, then my tracing would have been successful. We shall see in due time! Bu...
Post a Comment
Read more

Week 10: How to solve a problem

Hello my good friends! This week is the coveted fall reading break, and I hope you all are doing something useful with your time, like me, who is currently writing my SLOG. Now that the course is nearing its end, I would like to take it back to the beginning and try to solve one of those logic puzzles, using the Polya method we learned in class. I am, afterall, an amateur logician now, am I not? So here is the puzzle I have found from the problem solving wiki page. So without further ado, I present to you: Walk Tilings Suppose you have tiles that are 1x2 rectangles, and you have to tile a walk that is 2x3 units long. You've got three choices: 3 vertical tiles, 1 vertical tile followed by two horizontal tiles, or two horizontal tiles followed by one vertical tiles. How many choices do you have in tiling a 2x4 walk? How about a 2xn walk, where n is some natural number? Do you have a procedure that works for any n? Understanding the Problem Ultimately ...
Post a Comment
Read more