« first day (3447 days earlier)      last day (36 days later) » 

12:22 AM
CMP: Do you have a set of "standard" comments for the review queues? What do they look like?
e.g. for First Posts, Late Answers and some LQP, mine looks something like "Welcome to the site! Make sure to check out our [tips] (link) page for <language>, and that your answer meets our criteria for [input/output methods] (link). If you have any questions, don;t hesitate to ask me, or drop by our chat room [The Nineteenth Byte] (link). Hope you have fun here"
Could a mod unfreeze this room please?
 
12:48 AM
0
Q: Implement 1-dimensional version of Multi-Take

BubblerBackground Adám and I were once discussing a way to properly extend some features in Dyalog APL. I came up with the following extension to Take, a function that takes some front or back elements (and an analogous extension to Drop). We agreed that it was a good idea, but it was incredibly hard to...

 
 
6 hours later…
7:04 AM
0
A: Sandbox for Proposed Challenges

Mukundan314The almost impossible chessboard puzzle code-golf puzzle-solver error-correction Background Prisoner 1 walks in, sees a chessboard (8x8) where each square has a coin on top, flipped either to heads or tails. The warden places the key under one of the squares, which prisoner 1 sees. Before prison...

 
 
2 hours later…
9:06 AM
23
Q: Find the Pisano Period

cardboard_boxThe Fibonacci sequence is a well know sequence in which each entry is the sum of the previous two and the first two entries are 1. If we take the modulo of each term by a constant the sequence will become periodic. For example if we took decided to compute the sequence mod 7 we would get the fo...

11
Q: Tic-Tac-Toe and Chess, with fewest [distinct] characters

YpnypnIn this form of the game Tic-Tac-Chec, the goal is to move chess pieces to get four-in-a-row. Your goal here is to figure out if a position has a winning move. Rules The rules are similar, but not identical, to those of Tic-Tac-Chec. The board is 4 by 4 squares. Each player has a rook, bishop, kn...

 
9:19 AM
 
@Bubbler Neil has a lot of gold badges
 
10:05 AM
0
Q: Shortest Python 3 for sum of arithmetic progression

EvgenyInput: from STDIN number of vertices in Graph $2 \leq N \leq 100$. Rules: [Code size] = max ([code length without spaces, tabs and newlines], [total code length divided by 4]) Math formulation: In the graph of N vertices, between each pair of vertices can be 3 road states: there is no road there...

 
10:36 AM
0
Q: What's so great about code-golf. We're in the 2020s and memory isn't an issue. How about code-FormulaOne instead?

chasly from UK The challenging nature of aggressively optimizing for program size has itself long been recognized https://en.wikipedia.org/wiki/Code_golf In the old days, memory was very limited The larger 360 models could have up to 8 MB of main memory, though main memory that big was unusual—a large instal...

 
10:49 AM
How to get the gold golf badge from 200 answers? Make sure you get 5 votes per answer.
Who is the person who wrote the fewest answers as they got the gold badge?
Well, codegolf.stackexchange.com/users/1490/howard wrote 288 posts and got the gold badge...
codegolf.stackexchange.com/users/30688/feersum wrote 210 posts and got the gold badge...
Looks like feersum is the best golfer on CGCC!
 
I think it's perfectly possible to get a gold badge from 200 answers by answering several very old highly-popular questions shortly after they were posted (the answer quality doesn't matter) and then writing more answers until you have 200.
 
11:17 AM
with over 3000 answers in total, my problem is writing good enough answers :-(
2
 
11:28 AM
@Neil Try writing in brainfuck. It's simple to use, and people will always give you a lot of votes for free for brainfuck answers!
(The other two popular voting languages are Assembly language and Malbolge)
 
11:48 AM
@Neil I think you write good enough answers!
Not enough people seem to appreciate a well explained answer if that's the case
 
@Lyxal I wish my answers have as many votes as Neil's answers.
John B. Goodenough
 
12:18 PM
(The person who contributed to Lithium batteries. He got the Nobel Chemistry Prize in 2019.)
 
12:44 PM
I just bought a horrible algorithm book, all questions are easy-peasy for me...
Like, there's a question about checking whether the given input is a power of 2. The sample program is 6 lines of code!
I could do it in one line: def x(a):return a==1<<len(bin(a))-3
I really wanted to call the author "un-clever".
 
@Third-party'Chef' APL (Dyalog Extended), 5 bytes 1=1⊥⊤
 
They claim that there 100,000 lines of code in the book! Most lines are definitely excessive.
@Adám Good idea! We should have an APL cookbook.
 
@Third-party'Chef' This? or this?
 
x=lambda a:a and-a&a==a works, I think?
 
1:10 PM
@Neil Clever! (I golf in Io, so I'm not sure if I can wield bitwise operators...)
 
 
3 hours later…
4:34 PM
3
Q: Implement a UNIX file system and command line parser

MrSiliconGuyDescription Your task is to implement a simple UNIX command parser and file system. Your program will have to implement a file system that can be modified via commands. The starting directory of your file system is an empty root directory /, with no subdirectories or files. Your program must be c...

 
 
7 hours later…
11:20 PM
Could someone explain to me how Brainfuck is turing complete? I‘ve tried to wrap my head around it, read multiple articles and so on but one thing has never been properly answered: A language being TC means that, theoretically, it can „do anything“. That means that for any given task, a program can be written in the language which does that task. But I can think of a number of things brainfuck (or some other TC languages) can’t do. For example, write or read an arbitrary file.
I‘m guessing my mistake is in the definition of TC, but that‘s how I‘ve had it explained to me in the past
 
at its heart a turing machine can't read or write files, it just has a long binary tape
 
11:37 PM
Any feedback for this?
@cairdcoinheringaahing My understanding is that a Turing machine "assumes" necessary data is already loaded in memory, computes something on it, and leaves the result there (if it halts). So a language can be Turing-complete (i.e. simulate a Turing machine) without any I/O capabilities.
 
@Bubbler So TC-ness is more "able to do any computation on a specific input" rather than "able to do anything"?
 
You might want to change "do anything" to "do anything computational".
@cairdcoinheringaahing Essentially yes.
 
@Bubbler That makes much more sense, thanks!
 

« first day (3447 days earlier)      last day (36 days later) »