On Dec 17, 2007 5:38 AM, comex <[EMAIL PROTECTED]> wrote:
> Uh oh... I can't say I'll be able to fix my program before then. Well, I
> might. We'll see.
Send it in anyway. Maybe you'll get lucky, and I'll change my mind
about the endianness issue.
-root
I still have very little clue how to work with this. I might be able to
throw something together during computer class, but otherwise, I probably
won't be sending anything in.
On Dec 17, 2007 7:38 AM, comex <[EMAIL PROTECTED]> wrote:
> On Monday 17 December 2007, Ian Kelly wrote:
> > I remind the
On Monday 17 December 2007, Ian Kelly wrote:
> I remind the contestants of Brainfuck Golf that there are only 10
> hours left to enter programs for this task. If you've got one, send
> it in!
Uh oh... I can't say I'll be able to fix my program before then. Well, I
might. We'll see.
signa
On Dec 10, 2007 11:21 AM, Ian Kelly <[EMAIL PROTECTED]> wrote:
> I don't think there's any need to wait on contestification or my
> intended amendment to go through, so let's get started.
>
> We'll begin relatively simple: the first task for Brainfuck Golf is
> to print out all the prime numbers (
On Dec 12, 2007 4:25 PM, Zefram <[EMAIL PROTECTED]> wrote:
> Ian Kelly wrote:
> > I've never seen any version of Arabic
> >numerals that was little-endian.
>
> Actually Arabic numerals in their original form *were* little-endian.
> Written right-to-left, like the rest of the
Ian Kelly wrote:
> I've never seen any version of Arabic
>numerals that was little-endian.
Actually Arabic numerals in their original form *were* little-endian.
Written right-to-left, like the rest of the Arabic script. When they
were adopted by Europeans, the same visual
On Dec 12, 2007 3:40 PM, comex <[EMAIL PROTECTED]> wrote:
> On Wednesday 12 December 2007, Ian Kelly wrote:
> > > What about little-endian binary?
> > I would interpret "binary" to mean "binary numeral system" rather than
> > "binary data encoding". I've never seen any version of Arabic
> > numera
On Wednesday 12 December 2007, Ian Kelly wrote:
> > What about little-endian binary?
> I would interpret "binary" to mean "binary numeral system" rather than
> "binary data encoding". I've never seen any version of Arabic
> numerals that was little-endian.
>
> -root
Not sure what you mean there,
On Dec 12, 2007 11:28 AM, Geoffrey Spear <[EMAIL PROTECTED]> wrote:
> I came very close to writing a perl program that was going to figure
> out for me the optimal steps to take to do things this way, which also
> seemed a bit like cheating. Then I briefly toyed with the notion of
> writing a Brai
On Dec 12, 2007 10:35 AM, comex <[EMAIL PROTECTED]> wrote:
> On 12/12/07, Ian Kelly <[EMAIL PROTECTED]> wrote:
> > I explicitly enumerated the allowable printing methods, and base 256
> > wasn't one of them. Or at least that was my intention. I'll have to
> > be clearer next time.
> What about li
On Dec 12, 2007 11:36 AM, Ed Murphy <[EMAIL PROTECTED]> wrote:
> Wooble wrote:
>
> > I didn't try to figure out how to actually go about computing primes;
> > how to do any sort of useful conditional statements was beyond me
> > (since submitting my program I read up a bit on brainfuck algorithms
>
On 12/12/07, Ian Kelly <[EMAIL PROTECTED]> wrote:
> I explicitly enumerated the allowable printing methods, and base 256
> wasn't one of them. Or at least that was my intention. I'll have to
> be clearer next time.
What about little-endian binary?
On Dec 11, 2007 11:01 PM, Kerim Aydin <[EMAIL PROTECTED]> wrote:
> However, can you clarify: the list of allowable printing methods permits
> different bases as long as its consistent, but just printing out the ASCII
> character for each number and referring to the lookup table (as someone
> sugge
Wooble wrote:
I didn't try to figure out how to actually go about computing primes;
how to do any sort of useful conditional statements was beyond me
(since submitting my program I read up a bit on brainfuck algorithms
and should probably be better equipped for the next task, but it would
have f
On Dec 11, 2007 6:18 PM, comex <[EMAIL PROTECTED]> wrote:
> On Monday 10 December 2007, Ian Kelly wrote:
> > We'll begin relatively simple: the first task for Brainfuck Golf is
> > to print out all the prime numbers (and only the prime numbers) less
> > than 256, delimited by newlines, and then te
On Wed, 12 Dec 2007, Zefram wrote:
> The task specification doesn't explicitly disallow printing out non-primes
> either. Would a program that prints all integers from 0 to 255 qualify?
Actually it says (and only prime numbers). -G.
Ian Kelly wrote:
>The task doesn't disallow it. If it's somehow helpful to do that, go for it.
The task specification doesn't explicitly disallow printing out non-primes
either. Would a program that prints all integers from 0 to 255 qualify?
-zefram
On Tue, 11 Dec 2007, Ian Kelly wrote:
> The task doesn't disallow it. If it's somehow helpful to do that, go for it.
However, can you clarify: the list of allowable printing methods permits
different bases as long as its consistent, but just printing out the ASCII
character for each number and
On Dec 11, 2007 7:52 PM, comex <[EMAIL PROTECTED]> wrote:
> On Monday 10 December 2007, Ian Kelly wrote:
> > We'll begin relatively simple: the first task for Brainfuck Golf is
> > to print out all the prime numbers (and only the prime numbers) less
> > than 256, delimited by newlines, and then te
On Monday 10 December 2007, Ian Kelly wrote:
> We'll begin relatively simple: the first task for Brainfuck Golf is
> to print out all the prime numbers (and only the prime numbers) less
> than 256, delimited by newlines, and then terminate.
Am I allowed to print out a prime more than once?
signa
Ugh. You guys sound so far along. I'm a comlete newb and still am wondering
how I am going to do this.
On Dec 11, 2007 7:30 PM, Ian Kelly <[EMAIL PROTECTED]> wrote:
> On Dec 11, 2007 4:18 PM, comex <[EMAIL PROTECTED]> wrote:
> > So, I'm a brainfuck newbie. I've made a program to store the primes
On Dec 11, 2007 4:18 PM, comex <[EMAIL PROTECTED]> wrote:
> So, I'm a brainfuck newbie. I've made a program to store the primes in
> memory (not print them) that is 267 valid characters long. But I wouldn't
> be surprised if someone else has made a much shorter implementation; and I
> bet formatt
comex wrote:
>Thoughts? Can I hear some other peoples' character counts?
I don't want to give away competetive details, but I'll give some
approximate information. The first working version of my code to generate
and print the primes was about 350 characters. That was roughly half
for generati
On Monday 10 December 2007, Ian Kelly wrote:
> We'll begin relatively simple: the first task for Brainfuck Golf is
> to print out all the prime numbers (and only the prime numbers) less
> than 256, delimited by newlines, and then terminate.
So, I'm a brainfuck newbie. I've made a program to sto
On Dec 11, 2007 9:47 AM, Geoffrey Spear <[EMAIL PROTECTED]> wrote:
> Do you have a preferred newline format? Is the ASCII LF character
> sufficient rather than a CR LF?
I prefer just LF, but I intentionally left it vague because it doesn't
matter much to me.
-root
On Dec 10, 2007 1:21 PM, Ian Kelly <[EMAIL PROTECTED]> wrote:
> I don't think there's any need to wait on contestification or my
> intended amendment to go through, so let's get started.
>
> We'll begin relatively simple: the first task for Brainfuck Golf is
> to print out all the prime numbers (a
26 matches
Mail list logo
