Comments on: How To View Inception Through Code

By: How To View Golden Globe Nominee Inception Via Code | Wonder How Do I

How To View Golden Globe Nominee Inception Via Code | Wonder How Do I — Wed, 04 May 2011 07:24:59 +0000

[...] over at RepeatGeek wrote an article called How To View Inception Through Code, which compares the film to coding, which seem to be remarkably [...]

By: dhirschl

dhirschl — Wed, 26 Jan 2011 19:39:50 +0000

Thanks – you are correct.

By: james

james — Wed, 26 Jan 2011 19:36:25 +0000

I believe your explanation of the stack is flawed. Stacks are always LIFO (Last in, first out). Wikipedia has a good definition of how a stack works and how it is defined as a LIFO.

“In a stack, the topmost item, which is added last, is taken out first. Hence a stack is a LIFO structure.”

So in the Inception stack, we see that level 5 was “Last In” and is the first to be popped off the stack, hence LIFO. You should update the article to state that Inception follows the LIFO paradigm.

By: dhirschl

dhirschl — Wed, 15 Dec 2010 18:28:03 +0000

Nice Catch. This has now been updated. Thanks.

By: Matthew Knippen

Matthew Knippen — Wed, 15 Dec 2010 18:19:43 +0000

There is a typo in step one of the stack, it says it uses FIFO, which is correct, but then explains that it is First-In, Last-Out (FIFO) manner. It Should be First-In, First-Out. Great Article.

By: dude

dude — Mon, 23 Aug 2010 17:09:47 +0000

Not really impressed with your logic…

maybe a loop for checking the condition of the Kick?… and death…

Movie had a “glitch” (in my opinion) how did they get the drug into dream? should have used some phsichy trick…

By: All things Inception | Lens

All things Inception | Lens — Thu, 05 Aug 2010 14:22:26 +0000

[...] More programming link [...]

By: kamalcom

kamalcom — Wed, 04 Aug 2010 08:05:01 +0000

Nice comparison and nice movie

By: Prabhakar

Prabhakar — Wed, 04 Aug 2010 05:56:31 +0000

I think similarly.
I see everything as a recursion, where a kick is the terminating condition.

Limbo is a special case where the recursive loop never terminates due because of the corruption of the terminating condition due to buffer overflow (lol)

And sedation is the parameter passed to the recursive function that controls the recursion duration. Similar to your thread timeout logic.

By: Joe Darcy

Joe Darcy — Wed, 04 Aug 2010 05:34:19 +0000

Another summary of Inception in code:

“Understanding Inception using try-with-resources”
http://blogs.sun.com/darcy/entry/understanding_inception_using_try_with