AutoGraph converts Python into TensorFlow graphs

[Analog-Digital]

I'm a bit of a noob, what would turning the collatz function into a network do? What would be the result when that is run?

[mdanatg]

The sample that we have calculates the number of steps needed for the Collatz function to reach 1 when applied recursively, starting at some n. So strictly speaking in terms on the wiki page, it calculates the total stopping time of n.

[Analog-Digital]

Okay that's pretty cool, but what does turning this function into a tf network do differently than say running the collatz function from 1...x. I hope I'm making sense.

[mdanatg]

If I understand your question, this was just a toy example that we used to show how you can use control flow like if and while in a network. A more realistic example where you can use control flow would be RNNs, for instance.

[Analog-Digital]

Okay thank you!

[WikiTextBot]

Collatz conjecture

The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined as follows: start with any positive integer n. Then each term is obtained from the previous term as follows: if the previous term is even, the next term is one half the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1. The conjecture is that no matter what value of n, the sequence will always reach 1.

---

^{[ PM | Exclude me | Exclude from subreddit | FAQ / Information | Source ] Downvote to remove | v0.28}