The Nineteenth Byte

Steven H.

12:00 AM

@ATaco going for the bonus, Pyth, 15 bytes: AE.A<H #m%Q^Gd

Marcus Andrews

Would there happen to be a shorter way to do a,b=gets.split.map(&:to_i) in Ruby?

Conor O'Brien

a,b=gets.split.map &:to_i

Adám

@ATaco APL (Dyalog), 11 bytes, no bonus: ⎕∧.>⎕⊥⍣¯1⊢⎕

Destructible Lemon

how can i download every garfield birthday strip easily? how do I programmatically download stuff like that

ATaco

12:40 AM

Potentially really bad idea: Should I give Funky the ability to define Precompiler Macros?

Conor O'Brien

why not

you can always strongly discourage it in the style guide a la C++

Anonymous

@StevenH. I wasn't upset. I just had other things to do.

Pavel

1:03 AM

@ConorO'Brien That tries to apply the bitwise & operator to the result of gets.split.map with no arguments and to the symbol :to_i.

Conor O'Brien

@Pavel Not if there's a space.

Steven H.

@Mego That makes me feel at least a little better. Still sorry for being so stubborn

New Main Posts

0

Q: Parse my Esperanto!

The famous constructed language Esperanto uses the Latin alphabet (mostly, see the linked wikipedia page for details). However, there are some characters with accents: ĉ, ĝ, ĥ, ĵ, ŝ, and ŭ. (C-circumflex, g-circumflex, h-circumflex, j-circumflex, s-circumflex, and u-breve.) Naturally, these chara...

quartata

1:27 AM

@StevenH. FWIW that was all moot anyways since the definition of the Halting Problem requires finite input strings over a finite alphabet

Remember that it was made with Turing Machines in mind, not exactly an infinite ordinal friendly computational model :P

@ATaco Not a whole lot of point if it's not compiled

ATaco

It has a tokenizing step, so you could insert the precompiler just before that in the pipeline.

quartata

Yeah but the point of preprocessing macros is to offload work onto compile time

well and code generation

If it's happening at runtime though there's no point

Reflection would probably be faster for the latter and the former is totally pointless

ATaco

There is one compiled part of Funky. But it's to compile the tokenizer's tokens into a more digestable format, which happens once per version of the language.

And a precompiler isn't very useful for that.

user202729

1:44 AM

@ConorO'Brien Is it really solvable that way, I don't believe the *= and /= are in-place... CMC: Given a bignum x represent as a list of bytes (base256) or other format (but must not be in base 10), divide it by 10 with constant extra memory.

ATaco

...Can I represent it as a BigNum..?

user202729

What is your bignum type?

ATaco

java.math.BigDecimal

user202729

It's easy to convert BF with input to BF hardcode input, just write a BF self-interpreter. As long as the input are computable.

quartata

@user202729 Doesn't matter if += is in place, if the architecture can't do it it'll use a register

user202729

1:48 AM

Well, so no.

I mean += for bignum. And I'm talking about *= and /=.

But assuming you can, what next? You can't do anything because java big decimal is immutable, and if you create a new one with size non-constant, you lose.

Unless you use some reflection to modify it and Java BigDecimal is implemented as base 10, then it is still not allowed.

ATaco

Although a cheeky solution, this did not consider the constant memory restraint.

Downgoat

3:04 AM

@ConorO'Brien teascript: "Aa"N0 idk if still works

New Main Posts

0

Q: Swapping 2 and 3

Introduction Your friend somehow didn't learn that the number 2 comes before the number 3. Instead of correcting him, you decide to have some fun doing basic arithmetic with the numbers 2 and 3 swapped. Example of how he counts: 1, 3, 2, 4, 5, 6, 7, 8, 9, 10, 11, 13, 12, 14, 15, 16, 17, 18, 19,...

code-golf math number

Wheat Wizard

4:16 AM

idea: programming language in which rearranging the characters of a program does nothing.

ATaco

4:28 AM

Lenguage.

Wheat Wizard

Ok but can it be golfier?

ATaco

Of course.

Sherlock9

5:42 AM

I just edited my 128-year challenge: codegolf.meta.stackexchange.com/a/14279/47581 Thoughts?

ATaco

6:05 AM

A solution to this shuffling programming language I've written is a bit of a strange one. Firstly we sort the program, because order obviously can't matter, then we take all bytes greater than 127 and multiply their (n-128)th primes, so essentially their an array of prime factors, but because that doesn't cover all outcomes (particularly large ones) we sum the rest of the bytes as well to this total. Then we use this total like we would for Lenguage.

I'll let you know if I find the cat program any time soon.

Pavel

user202729

So how golfy can it be?

There would be binomial(n+255,255) programs with n bytes.

DJMcMayhem

@WheatWizard That train of thought gave me a combinatorics question that I'm not sure how to answer. With a dictionary of "y" different letters, how many 'words" of length n are unique when sorted?

user202729

What is "y"? A variable?

DJMcMayhem

For example, if the dictionary was {0, 1} and the length was 3, you'd have [000, 001, 011, 111] which is 4

user202729

6:17 AM

@DJMcMayhem Well, just binomial(n+y-1, n) == binomial(n+y-1, y-1).

DJMcMayhem

@user202729 Just the length of the dictionary I guess

Wheat Wizard

Yeah, what they said.

DJMcMayhem

I feel like I'm kinda dense. I'm not sure exactly what that means

Wheat Wizard

binomial(n,m) is n choose m

DJMcMayhem

Oh, I would have understood that

user202729

6:20 AM

binomial(n, m) = (n choose m) = n!÷(m!×(n-m)!)

ATaco

IT's F7 8E 77 by the way.

DJMcMayhem

@user202729 Where n is word length and m is dictionary length?

Wheat Wizard

I have an idea for the language, it's even character agnostic, i.e. it doesn't care what characters you use just how many

user202729

Which is Unary/Lenguage.

Wheat Wizard

I need to sleep though, so that's for tomorrow (read as never)

@user202729 No its not, unary only cares about how long your program is e.g. aaab is the same as aaaa

Here aaab would be the same as cccd or eefe but not gggg

user202729

6:23 AM

So this one is <number of integer partition of size <= 256 of byte-count>

DJMcMayhem

Would it be the same as ab?

user202729

Pretty sure there are nice g.f. , but probably not closed-form.

Wheat Wizard

@DJMcMayhem No it would be the same as any program with 3 of one character and one of another.

@user202729 I don't really understand this, each program is basically 256 integers of unbounded size.

DJMcMayhem

@WheatWizard Does position of first occurrence matter? (e.g. is "aaab" == "bbba"?)

Sorry for the edit pings

Wheat Wizard

The easy way would be to use Hilberts hotel to generate a lenguage type number and decode into brainfuck, but that's boring.

user202729

6:26 AM

Mathematica have builtin for that: Length@IntegerPartitions[10, 256] returns number of 10-byte different program.

DJMcMayhem

I kept noticing a single typo

Wheat Wizard

@DJMcMayhem No it doesn't. aaab == bbba == babb. I don't mind the pings :P

@user202729 Well to be fair Mathematica has a builtin for everything.

user202729

But that's a very slow way of calculating... it enumerates all possible programs and count.

Wheat Wizard

There is a nice closed form

but I've forgotten it and I'm to tired right now to find it

I think the one I was remembering required the partitions to be of size at least 1.

And I also think the order mattered.

Does mathematica care about the order in IntegerPartitions?

user202729

No.

Wheat Wizard

6:32 AM

Well goodnight. I need to sleep.

New Main Posts

7:03 AM

0

Q: Odd'em out: letters

Objective Write a program that sorts out and returns the odd letter in the matrix of random size. Details You will be passed a matrix of random dimensions such as this. bbbbbbbbbb bbbbbdbbbb bbbbbbbbbb bbbbbbbbbb bbbbbbbbbb Your job is to find the letter that doesn't match the rest (in thi...

code-golf sorting matrix alphabet

muddyfish

9:09 AM

Hmm

user202729

Almost unreadable for me.

"1. Confusion"?

muddyfish

Yes

I'm reading that as obscurity given it's in referral to the Caesar cipher

Neil

9:53 AM

I saw a car with the plate 'ROT 132'... just 1 digit too many

NieDzejkob

10:36 AM

does anyone here so maths? how can I write $/frac{1}{2+3x+4x^2}$ as a polynomial? It'll have an infinite amount of terms, but it's about the coefficients of the first few

micsthepick

you may want to look at Taylor series: wikipedia

@NieDzejkob here is your function in wolfram alpha

user202729

Well, just solve equation.

New Main Posts

0

Q: cool untitled sequence thingy

Let's define fn(k) as the sum of the first k terms of the natural numbers [1, ∞) where each number is repeated n times. k | 0 1 2 3 4 5 6 7 8 9 --------+------------------------------------------------- f1(k) | 0 1 3 6 10 15 21 28 36 45 d...

code-golf math number sequence

user202729

10:52 AM

Too bad the denominator doesn't have nice roots...

micsthepick

@user202729 what do you mean?

what equation?

user202729

For the latter comment, wolframalpha.com/input/…

and for the former, you can get the coefficients into a system of equations and solve for each.

micsthepick

you need to explain how you make the system of equations. I assume both me and NieDze have no idea what you are talking about

user202729

You don't actually need to solve a general system of equation. Because (let bk = coefficient of x^k in the original sequence) you have for k != 0: ak * b0 + a(k-1) * b1 + ... + a0 * bk == 0 -> ak = (a(k-1) * b1 + ... + a0 * bk) / (-b0). n² solution, but I'm not aware of a faster solution.

What is <sup>superscript</sup> and <sub>subscript</sub> and ~~strikethrough~~ in comment?

NieDzejkob

11:33 AM

thanks, I'll do a Taylor series (btw, this is for OEIS)

Erik the Outgolfer

12:28 PM

@user202729 compose key is a setting for linux, and you can download it for windows

it's usually not an actual compose key

Transcript for