The Nineteenth Byte

« first day (2613 days earlier) ← previous day next day → last day (2528 days later) »

flawr

20:01

reading xkcd? :)

Pavel

Oh hey that's pretty good

Riker

a sapient human that enjoys doing, focuses on, or studies extensively a technical topic, typically stereotyped as lacking real-life social skills

@Pavel resists urge

moonheart08

where are you sandbox bot

it's been 7 minutes

New Sandboxed Posts

A: Sandbox for Proposed Challenges

Brainfuck Compiler! code-golf Your goal is simple: Compile brainfuck to x86 assembly (NASM style), and do it with as small of a program as possible. You will be able to choose your compiler's input model, as long as the input is brainfuck code and the output is NASM style x86 assembly. The bra...

Pavel

Riker

20:04

actually a golfier conditon

Pavel

(7 minutes is faster than average btw)

Riker

"someone who waits for the sandbox bot"

moonheart08

Anyways. pls giv feedback on post :p

Riker

2 issues

1 that's a bad format for test-cases pick a better one

2 uh how are you going to specify the output nasm?

is it the same output nasm as what you give, or must it just take the same input/output?

moonheart08

it must output assembly NASM can compile

leme make that clearer

Riker

20:07

no that's not what I mean

what are the output specifications

must the output file be exactly what your reference implementation outputs?

or must the output nasm just return the same outputs for the same inputs

moonheart08

Must return the same outputs for the same inputs.

So a program that prints hello world must print hello world when compiled.

Riker

ok, what about i/o?

can we choose where our output program takes input from?

moonheart08

> The brainfuck code should read from STDIN and output to STDOUT

> You will be able to choose your compiler's input model,

so you can take STDIO, a file, etc etc

Riker

moonheart08

How should I format the test cases?

Ok. Thanks

Riker

20:13

I made some changes to be it bettre, not sure how to improve from there

anyway yeah you'll need more test cases

moonheart08

Mk. I'll look for some

And maybe make some

moonheart08

20:27

+[<+] should loop forever in brainfuck right? My interpreter just stops and doesn't do much of anything.

quartata

Depends on your interpreter

DJMcMayhem

@moonheart08 If it's unbounded in both directions it should loop forever. But if it's left bounded it should stop

moonheart08

Yea, unbounded is the case i'm thinking of here.

totallyhuman

unless the cells loop around also

quartata

Actually if it wraps around it'll stop eventually

Since the cells overflow

Yeah

DJMcMayhem

20:32

@quartata Only if the IP wraps

If it's truly unbounded, eventually it'll just run out of memory and crash

quartata

That's what I meant, if the tape wraps around

DJMcMayhem

Ah, ok

Riker

21:05

I've found this 'gem'

it's only specifications tho

ASCII-only

22:03

@Riker someone should totally write a graphical interpreter for this

New Main Posts

22:14

Q: Levi-Civita symbol

The three-dimensional Levi-Civita symbol is a function f taking triples of numbers (i,j,k) each in {1,2,3}, to {-1,0,1}, defined as: f(i,j,k) = 0 when i,j,k are not distinct, i.e. i=j or j=k or k=i f(i,j,k) = 1 when (i,j,k) is a cyclic shift of (1,2,3), that is one of (1,2,3), (2,3,1), (3,1,2)....

Destructible Lemon

@Pavel being a nerd

is it possible to make a language which, without a special command, is turing incomplete, but given the special command to solve the halting problem for the turing incomplete variant lacking the stated command, becomes turing complete?

DJMcMayhem

o_O

Destructible Lemon

is that really that confusing?

Downgoat

yes

Destructible Lemon

let me rephrase

consider a language which will be referred to as x, because i can't think of something else

language x is turing incomplete

consider the language x' which is x with a command that takes a program written in x, and returns whether it halts

is there such an x such that x' is TC

obviously not a rigorous question because it's subjective in some ways

like, it'd be possible to make it so that some commands aren't accessible until you solve the halting problem or something...

New Main Posts

22:50

Q: Work out root(x, n)

Given 0<x<10106 and 0<n<106, work out x(1/n) under 15 seconds(TIO or your computer), 1GB memory. You can assume the result is integer smaller than 50000. Shortest code in bytes in each language win. Sample: x n result 121 2 11 123 1 123 1024 10 2

code-golf math

Zacharý

23:05

Anyone know what the formula for standard deviation of a sampling distribution of variance is? I'm having trouble finding it online

@Adám Probably don't ask on MathOverflow.

Adám

@Zacharý I think you can find it on

Standard deviation

In statistics, the standard deviation (SD, also represented by the Greek letter sigma σ or the Latin letter s) is a measure that is used to quantify the amount of variation or dispersion of a set of data values. A low standard deviation indicates that the data points tend to be close to the mean (also called the expected value) of the set, while a high standard deviation indicates that the data points are spread out over a wider range of values. The standard deviation of a random variable, statistical population, data set, or probability distribution is the square root of its variance. It i...

(about a third way down)

Zacharý

I can't find anything but a note about the standard deviation of a sampling distribution of standard deviation following chi-distribution. Can you show me which section you're looking on>

Stats terminology is weird.

Downgoat

ppcg-v2: do you like this over the previous design?

ASCII-only

wow looks very nice

but idk what previous design is

Zacharý

I found 2*sigma^4/(n-1) on the page on variance, but that seems wrong.

Downgoat

23:23

@ASCII-only this is old designe

Zacharý