12. leaders
new entries
ned.
fcn f(x)
...
1 michael
2 alice
3 bob
4 ned
bob.
fcn f(x)
...
michael.
fcn f(x)
...
alice.
fcn f(x)
...
Michael wins!
Everyone else is a
loser who wasted
their time...
14. leaders
leaders
1 michael
2 alice
3 bob michael.
fcn f(x)
...
view entry
new entry
ned.
fcn f(x)
...
1 ned
2 michael
3 alice
4 bob
Ned takes
the lead!
15.
16. • Entries are scored, ranked, and
displayed immediately
• Code and score are visible at all times
• Anyone can modify anyone else's
code and resubmit it as their own
17. • Entries are scored, ranked, and
displayed immediately
• Code and score are visible at all times
• Anyone can modify anyone else's
code and resubmit it as their own
See it
Steal it
Transparency
18. • Entries are scored, ranked, and
displayed immediately
• Code and score are visible at all times
• Anyone can modify anyone else's
code and resubmit it as their own
See it
Steal it
Fork it
Transparency, Generosity
24. Think like an ecosystem
• Define value
• Lower barriers to entry
• Reward participation across scale
• Reward participation across modes
• Self-interest motivates sharing
28. Big changes…
function f = fb(n)
a = [0 1; 1 1]^n;
f = a(2);
function f = fb(n)
if n > 2
f = fb(n-1) + fb(n-2);
else
f = 1;
end
Generating the nth Fibonacci number: 1, 1, 2, 3, 5, 8, 13, ...