Week 6 Slog

This week I have studied the Python Motivating Trees coding. This method is a fun way to show the relationship between things. In this week’s lab I have studied the list comprehensions that are easier than normal ways. Indeed, this method can allow us to compress document size through less inputs. We can express the same things through less codes, and this would effectively increase programmers’ efficiency. I think that this method is very useful for research purposes. For example, I can create a timeline using the motivating trees method and place alternative events that happened or could have happened in history. Then I can run a textual analysis on the tree to filter the course of history. This way is a good calculation of the parallel dimensions of our world. 

Week 5 Slog

I have watched a game show these days, the game requires a player to remember the shape of 20 keys and their respective locks, the MC then picks a lock randomly, and the player needs to find the key that will open the lock. I have thought of a way to quickly find the matching key using tracing recursion. We can set the trough as 0 and the crest as 1. Then each key will have a particular set of binary series, which can be transformed into a real number. We can use this number to match the key to its lock. Through this method, we can easily win this game. Therefore, the tracing recursion that we have learned this week is very useful. It can help me win this game if I participate in this show.