The Nineteenth Byte

Destructible Watermelon

11:00 AM

hmmmmm, a list is kind of redundant for direction, isn't it?

ASCII-only

@DestructibleWatermelon Prime checker = prints truthy if a number is prime?

Destructible Watermelon

yup

Steven H.

CMC: Code an OEIS sequence in ABCR: github.com/Steven-Hewitt/ABCR

(Yes, you could choose the natural numbers. Yes, that's a boring answer.)

ASCII-only

@DestructibleWatermelon How long was it

Destructible Watermelon

is there any easy way to add a list to a list in python (i.e. [5,6]+[1,0]=[6,6])

TuxCopter

11:07 AM

@DestructibleWatermelon Yes: [l1[0] + l2[0], l1[1] + l2[1]]

Destructible Watermelon

well, I asked badly

I meant as in so that [6,6] is new value of original list

also seems pretty verbose

TuxCopter

l1[0] += l2[0]; l1[1] += l2[1]

ASCII-only

@DestructibleWatermelon def f(a,b):a[:]=map(lambda x,y:x+y,zip(a,b))

Steven H.

l1 = [x+y for x,y in zip(l1,l2)]

@ASCII-only if you want to golf it use __add__ instead of lambda

ASCII-only

@StevenH. Pretty sure that doesn't work

Destructible Watermelon

11:12 AM

driest approach, I think

for i in range(2):
    dimensions[i]+=direction[i]

range(len(dimensions)) when list length not known

Steven H.

For some reason I thought Python number literals had __add__, my bad

Destructible Watermelon

ok, got the movement part working

now the actual commands

Steven H.

The list comprehension is actually shorter anyway than mapping

TuxCopter

brb

Destructible Watermelon

most natural way for getting the alphabet? (python)

ASCII-only

11:16 AM

@DestructibleWatermelon __import__('string').lowercase I think

Destructible Watermelon

ok, not exactly but thanks

gave me the info I need

variables={i:0 for i in string.ascii_lowercase}

for my initial variables

ASCII-only

@DestructibleWatermelon Charcoal, 35 (;_; it's such a bad score)

@DestructibleWatermelon Wait does that work

Destructible Watermelon

mine is longer...

wait what is this

ok, is prime checker

also mine is a lot longer than yours, and also a lot slower

but that's just my language

Cameron Aavik

I had an idea for a codegolf puzzle, not sure if people would be interested. My uni has a checksum algorithm to determine the last digit of a student number given the first 7. The puzzle would be to take the first 7 digits and return the 8th digit. You reckon that'd be worth making a puzzle for? Or too similar to other checksum-related ones.

Emigna

11:34 AM

@CameronAavik We have a sandbox where you can specify challenge ideas and get response on things like that. Easier to say when you have more information.

Destructible Watermelon

halp, trying to figure out best behaviour to include " inside a string delimited by that...

Emigna

\ ?

Destructible Watermelon

well, escape char is `

Emigna

well, that then

Destructible Watermelon

well, let me explain the issue a bit more

say we want escape magic char [

we write `[, but both of these are pushed to stack

because the parsing of escape comes after pushing

because the parsing of the regex comes after

but " doesn't need to be escaped in a regex

Emigna

11:36 AM

ah, and the escape char is now under the char to escape on the stack

can you just write it like [` then?

Destructible Watermelon

no, that isn't an issue

also why on earth did I say push to stack

I'm not thinking right now

I meant concatenate on the end of the variable

:p stupe

sorry about that

the issue is, is that the escape char just marks that it has to be considered differently in the regex: using it to escape end of string is a totally different duty

I guess I could just make one of the chars match the EOS

1

A: Is this number a prime?

Turtlèd, 490 487 451 bytes Turtlèd does not support newlines in code... so oneliner fun! golfed some bytes for not needing to support 0 Golfed some bytes removing useless code, and some other tricks ?#0#.:l( >;,u,[ :ll[*,l]d],u{*{*r}l' d{ l}[ (*.d)(0'1d)(1'2d)(2'3d)(3'4d)(4'5d)(5'6d)(6'7d)(7'...

incredibly long

I guess I could make ' match ", and " match '....

but that might be slightly confusing at best

I guess I'll take the route of "" matches "

hmmm, actually I don't like that much

oh wait someone down gaoted my prime checker ._.

ASCII-only

@DestructibleWatermelon D: why is it so long

Destructible Watermelon

because turing tarpit....

Turtlèd has no arithmetic commands

only moving and writing on grid

Qwerp-Derp

Argh I don't think Repetition can achieve anything at all

Destructible Watermelon

@Qwerp-Derp it doesn't have control flow...

Qwerp-Derp

11:47 AM

Control flow?

TuxCopter

back

Qwerp-Derp

@DestructibleWatermelon Now there is

Destructible Watermelon

cool

Qwerp-Derp

While loop

Destructible Watermelon

link?

pls

Qwerp-Derp

11:48 AM

github.com/DerpfacePython/Repetition/blob/master/README.md

Destructible Watermelon

well, yeah, don't think that's gonna cut it

Qwerp-Derp

True

Ummm... variables?

Destructible Watermelon

in the end it just evaluates to an expression, or an infinite loop. Would be easy to determine

@Qwerp-Derp 2 should probs be enough, maybe three

Qwerp-Derp

wait what

MatthewRock

Hello, feel free to help me improve or comment on my challenge draft: meta.codegolf.stackexchange.com/a/10367/15174

Destructible Watermelon

11:50 AM

2 variables

TuxCopter

@DestructibleWatermelon 2 unbounded variables is sufficient to be TC

Destructible Watermelon

.... yeah

2 variables

they're already unbounded

@TuxCopter also one is as well

TuxCopter

No

Destructible Watermelon

also 2 is not always, depending on lang

TuxCopter

Two variables is the minimum

Destructible Watermelon

11:52 AM

BF needs three

@TuxCopter incorrect

minsky made one

TuxCopter

Huh

Qwerp-Derp

Ummm

So is this good?

Declare vars by doing

TuxCopter

I tought a universal Minsky machine have 2 variables

Qwerp-Derp

b=+

(Now b=3)

Destructible Watermelon

@TuxCopter esolangs.org/wiki/Minsky_machine

Qwerp-Derp

11:54 AM

And while loops are

{b|code here}

Destructible Watermelon

@TuxCopter the most well known does, but he made another one

TuxCopter

> Minsky machines with two or more registers have been shown to be in the same computational class as Turing machines. Because of this, and because of their simplicity, they can be used to prove several esoteric programming languages to be Turing-complete as well.

Qwerp-Derp

The while loop only accepts vars

To alter a var:

TuxCopter

It say the minimum is 2 registers

Qwerp-Derp

(b|-)

Destructible Watermelon

11:54 AM

> He also describes a variation which is Turing-complete with only one register; this variation requires that the machine has operations to:

multiply the register by a constant; and
check to see if it is divisible by a constant, and if so, divide by that constant and effect an alternate state transition.

Qwerp-Derp

Or smth like that

TuxCopter

Fair enough

Destructible Watermelon

Also no variables is sufficient

TuxCopter

If you have another storage medium

Destructible Watermelon

esolangs.org/wiki/Nopfunge

not referring to tape or stack

bye

New Sandboxed Posts

12:04 PM

-1

A: Sandbox for Proposed Challenges

99 selttob fo reeb no eht llaw popularity-conteststring I teb ev'uoy lla draeh tuoba eht doog 'lo 99 selttob fo reeb no eht llaw. Llew ti os sneppah taht I emoc morf na evitanretla esrevinu - eht esrevinu erehw ew etirw gnihtyreve ni esrever! Ew peek eht snoitisop fo lanigiro hguoht. Siht osla s...