Berkeley CSUA MOTD:Entry 34720
Berkeley CSUA MOTD
2019/04/21 [General] UID:1000 Activity:popular

2004/11/6-7 [Computer/Theory] UID:34720 Activity:high
11/5    So, I'm reading "Godel, Escher, Bach" and I came to a part I think
        I should be able to understand, but I can't.  On page 137
        Hofstadter introduces a recursive function G, such that
        G(n)=n-G(G(n-1)) for n > 0, and G(0) = 0;  He then shows a graph
        that is supposed to corrospond to G, figure 30, on page 136.
        However, I just can't figure out how the graph is related to G.
        Can someone explain?  BTW For G(1)-G(8) I get the values
        1, 1, 2, 3, 3, 4, 4, 5. ok thx.
        \_ The graph shows the tree of recursive values.  G(4) and G(5) = 3;
           G(6) and G(7) = 4, G(9) and G(10) = 6, G(14) and G(15) = 9, etc.
           \_ Thanks tom.  That's pretty neat.
              \_ Awwww, Tom answers a math and science question.
2019/04/21 [General] UID:1000 Activity:popular

You may also be interested in these entries...
2010/8/29-9/30 [Recreation/Humor, Politics/Foreign/Europe, Computer/Theory] UID:53940 Activity:nil
        Funny graph.  -- linkpusher
2010/3/7-30 [Computer/SW/Languages] UID:53743 Activity:nil
3/7     My sister is graduating soon with a decree in information management.
        She was orignally CS, but couldn't cut the math, so her GPA sucks.
        However, she has had a couple of internships and did fine.  She did
        desktop support at RockYou and is currently doing web programming
        at UC Santa Cruz, but they can't keep her on after graduation.
        Anyone got any jobs?  She wanted to be a network admin, but right now
2009/12/8-26 [Computer/Theory] UID:53581 Activity:nil
        The next talk in the series will be entitled
        Spanning Trees and Aspects (The 15th Annual Christmas Tree Lecture)
        The spanning trees of a graph with n vertices are the sets of n-1 edges\
that connect the graph. In this lecture I'll discuss the remarkable relation bet\