Hacks and Tweaks


August 24, 2012

Where is Steve Jobs ? Afterlife Revelation

More articles by »
Written by: arunenigma
Tags: , , ,

A Buddhist temple in Thailand says it has pinpointed Steve Jobs’ whereabouts in the afterlife, and the late Apple co-founder is a mid-level angel living in a parallel universe (but still in California).

Wat Phra Dhammakaya made the revelations on its website in a post titled “Where Is Steve Jobs.”

The abbot of the temple, Phrathepyanmahamuni, came to learn of Jobs’ posthumous fate through meditation, the Bangkok Post reported. The abbot says Jobs is “a half Witthayathorn [a knowledge-seeking angel], half Yak [the Thai word for giant],” which is a mid-level angel. Since his death in October 2011, Jobs has been living a cushy afterlife in a six-story building “made of white, silver metal and crystal glass” not far from Apple headquarters in Cupertino, Calif., the Post reported.

According to the report, the temple said Jobs has 20 servants as a result of his “worldly virtue. The temple also said the claims about Jobs were intended to teach the law of karma to followers and “not meant to defame or insult any parties.”

Jobs died last year at the age of 56 after a long battle with pancreatic cancer. He has been credited with revolutionising everything from personal computing to music to phones.

About the Author

Computer Science Graduate Student @ Case Western Reserve University, Cleveland, USA



Python Factory Design Patterns using Switch Case

I googled for Factory Method Design Pattern in Python but couldn’t find a good resource. So, I  am sharing an example program to demonstrate this design pattern in Python which I frequently use. The factory method pattern is...
by arunenigma


Conway’s Game of Life Implemetation in Python with cool patterns

he Game of Life (or simply Life) is not a game in the conventional sense. There are no players, and no winning or losing. Once the “pieces” are placed in the starting position, the rules determine everything that ha...
by arunenigma


Python AVL Tree Implementation with ASCII visualization

n computer science, an AVL tree is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any tim...
by arunenigma



Binary Search Tree in Python with ASCII art visualization

Binary search tree implementation in Python with: in, post and pre-order traversals. Also includes methods for insertion, deletion and search of nodes. Deletion is fairly complex and is made possible by keeping track of parents...
by arunenigma


Python, Memoization, Dynamic Programming, Fibonacci Series and some Fun!

ython can implement the recursive formulation directly, caching return values. Memoization is a method where if a call is made more than once with the same arguments, and the result is returned directly from the cache. For exam...
by arunenigma