[can't find the question, but it's about code generation]
and the issue I'm facing is basically that. You write (source) code into TIO, choose Code Golf submission (Stack Exchange) part (get generated code), and add (source) explanation to it.
Then when you change the source code, you have to copy the explanation to correct place, which is often quite hard, partially because TIO permalink is long and SE answer box is small.
Can you explain this to me: https://tio.run/##Sy7WTS5O/v@/tDgzL10huLK4JDXXmosrOSexuFjBkauaSwEICkqTcjKTFYpLEkuAVFl@ZoqCb2JmnoamAli6movTOT@vOD8nVS@8KLMkVcPQQM8SFZgo2NoqGBpqWoM11HLV/v8PAA
The first two are considered "true" because of floating point error (can't remember the correct term), right? But I mean you would expect .91 and .92 to round to the same number, instead of .74 and .91... It's simply not intuitive
No, but it was a fine enough hack for early computer programmers to assign numbers to bits and leave it there. Now nobody wants to go back and try to implement binary-coded decimal or some other decimal method
@LucaH 10.999999999999998 is shorter than 10.9999999999999991. It is probably the nearest available floating point number (for a given definition of nearest)
Imagine a float as a string of digits and a decimal point, the further rough the decimal point is, the larger the number you can represent, but there's less values after the point so less precision
@LucaH For sure. Definitely try looking up the IEEE floating point standard if it interests you. There are some good resources out there that help explain it
But it's neither here nor there. Point is, you put too many 9s and the floating-point system started shoving those numbers into strange places, which are probably less confusing when shown in binary
Factor Trees
code-golf factoring (new tag!)
I once saw on the xkcd fora a format for expressing numbers in an odd way. In this "factor tree" format:
The empty string is 1.
Concatenation represents multiplication.
A number n enclosed in parentheses (or any paired characters) represents the n...
Prompted by this.
The question of APL's encoding often comes up, and many times a helpful soul links to Wikipedia's article on the APL EBCDIC codepage. However, each implementation of APL has its own encoding rules. What are they?
CMP: The 16 characters ɫ¯¥£¢ý·€⍫´∣¶¿¡ § are in the Dyalog APL character set but are not used in any way (ASCII, built-ins, box drawing, identifiers). The six characters ⊆⍠⍤⌸⌺⍸ are built-ins which are not in the character set (i.e. they force the entire solution into Unicode). Should we count the six characters as one byte each because it is technically possible to swap them for included characters?
@Adám Yep. Your encoding defines the characters on the right as being represented by the APL codepoints of the ones one the left, and now you have an implementation of Dyalog APL that accepts that encoding, made by tacking the tr script in front of the actual dyalog call.
I think it would work like that.
Might need to also first convert APL bytes to Unicode bytes first.
Find a fixed point
META: This is just meant as an introductory challenge for functional input (black box functions) and hopefully establish some more inputs.
code-golfmathoptimization
Given an integer x(1) and some black box function f: ℤ → ℤ find a fixed point of the sequence x(k+1) := f(x(k)...
Half joke. I appreciate the desire to have meaningful characters for functions, but at some point, you just can't really do it the way you want. One could at least come up with a few possibilities as opposed to the whole ASCII range.
Ugh, why did that "smallest number of participants" challenge get reopened? There are still open questions regarding rounding precision and direction, and it still doesn't make sense how "Rounded to the nearest hundredth" results in 8.97 going to 9.
After testing a couple $a_n$ by hand it appears to converge. So let's try to solve:
$$x = \frac{x+3}{x+4}$$
$$x(x + 4) = x+3$$
$$x^2 +3x - 3 = 0$$
$$x = \frac{1}{2}(\sqrt{21} - 3)$$
But if we want to be rigorous and prove its convergence:
$$a_n = \frac{p_n}{q_n}$$
$$\frac{p_{n+1}}{q_{n+1}} = ...
@LeakyNun I solved it with generating functions :P
@Adám not sure whether or when I'll get around to this, but can I send you a list of commonly used Unicode operators in Mathematica for your language bar?
@Adám Well, that's an exception since that's a shebang, not a Python comment. (Though it's technically also a Python comment.) ... Actually, lemme check.
Birthday Bash, Part 1: Invitations/Index
code-golf ascii-art date
January 29, 2018 will be my 16th birthday, so in the style of the Advent Challenges set, I'll be posting a series of 8 or so birthday-party-themed challenges. You can find the rest of the challenges in the sidebar.
As everyone...
@AdmBorkBork Can you help me out with a PowerShell question? The prompt function returns the string you want to be your prompt, how can I define it to print a colored prompt?
Factor Trees
code-golf factoring (new tag!)
I once saw on the xkcd fora a format for expressing numbers in an odd way. In this "factor tree" format:
The empty string is 1.
Concatenation represents multiplication.
A number n enclosed in parentheses (or any paired characters) represents the n...
Prompted by this.
The question of APL's encoding often comes up, and many times a helpful soul links to Wikipedia's article on the APL EBCDIC codepage. However, each implementation of APL has its own encoding rules. What are they?
Find a fixed point
META: This is just meant as an introductory challenge for functional input (black box functions) and hopefully establish some more inputs.
code-golfmathoptimization
Given an integer x(1) and some black box function f: ℤ → ℤ find a fixed point of the sequence x(k+1) := f(x(k)...
After testing a couple $a_n$ by hand it appears to converge. So let's try to solve:
$$x = \frac{x+3}{x+4}$$
$$x(x + 4) = x+3$$
$$x^2 +3x - 3 = 0$$
$$x = \frac{1}{2}(\sqrt{21} - 3)$$
But if we want to be rigorous and prove its convergence:
$$a_n = \frac{p_n}{q_n}$$
$$\frac{p_{n+1}}{q_{n+1}} = ...
