THE BORE

General => The Superdeep Borehole => Topic started by: recursivelyenumerable on October 17, 2010, 10:33:52 PM

Title: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: recursivelyenumerable on October 17, 2010, 10:33:52 PM

I cannot stop inflicting this on everyone in my apartment building. How ashamed of myself should I be?

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: Powerslave on October 17, 2010, 10:34:59 PM

the fuck the fuck the fuck

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: Diunx on October 17, 2010, 11:33:55 PM

smh

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: Bildi on October 18, 2010, 01:33:05 AM

ITT music nerds assembing.

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: Madrun Badrun on October 18, 2010, 02:04:46 AM

Recursive, how do I do an inductive proof for this recurence

T(n) = T(n/2) + n     n > 1
       =  3                 elsewise

where n = 2^k


I think the answer is nlg2n + 3 but I can't figure out the proof and feel dumb  :(

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: recursivelyenumerable on October 18, 2010, 02:07:22 AM

I'm going to sleep

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: Fresh Prince on October 18, 2010, 02:23:18 AM

bwhhaahhaa

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: Raban on October 18, 2010, 03:28:51 AM

is the recursive equivalent of a drunk thread?

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: Madrun Badrun on October 18, 2010, 01:25:52 PM

Quote from: recursivelyenumerable on October 18, 2010, 02:07:22 AM

I'm going to sleep

:(

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: Madrun Badrun on October 18, 2010, 06:52:41 PM

Quote from: Father_Mike on October 18, 2010, 02:04:46 AM

Recursive, how do I do an inductive proof for this recurence

T(n) = T(n/2) + n     n > 1
       =  3                 elsewise

where n = 2^k


I think the answer is nlg2n + 3 but I can't figure out the proof and feel dumb  :(

Solved it.  Recursive doesn't  live up to his name!

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: Tauntaun on October 18, 2010, 09:43:26 PM

Diminished baby!  :rock

Title: Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
Post by: Powerslave on October 18, 2010, 10:16:33 PM

omg that kitty in your avatar I wanna cuddle it to death  :-[ :heart