Sometimes image reconstruction algorithms are "straightforward"... an example would be filtered backprojection, where's there's a key mathematical transform used to take the imaging data and make an image.
The black hole imaging technique is more along the lines of... come up with the most detailed statistical model of the telescopes that you can, use bayesian priors to express what sorts of images you're expecting to see, and then use lots of iterative model fitting to figure out which image is the most likely image given the data.
Which isn't particularly surprising, but means that there's a lot of moving parts and I don't see an immediate way to simplify it down to something that's still functional but suitable for a code-golf.
The New York Times has a daily online game called Letter Boxed (the link is behind a paywall; the game is also described here), presented on a square as follows:
You are given 4 groups of 3 letters (each group corresponds to one side on the picture); no letter appears twice. The aim of the ga...
Write a program, given an input n, will generate all possible n-tuples using natural numbers.
n=1
(1),(2),(3),(4),(5),(6)...
n=2
(1,1),(1,2),(2,1),(2,2),(1,3),(3,1),(2,3),(3,2),(3,3)...
The output may be in any order.
The program must be written to run forever and list all applicable tuples ...
I think while trying to solve a challenge in one of my languages, I may have discovered an idea for an entirely new challenge that would help me solve the first one
for context, the challenge I'm trying to solve is alex-style addition the goal of which involves a 90-10 percent random split. I'm trying to solve it in LMBM, which can only do 50-50 splits.
@AdmBorkBork It is trig-function reduction, e.g. +/2 3 gives five, and the primary trigonometric function is sine, so ○/1 0.6 is sin(0.6rad) and ¯1○0.5 is arcsin(0.5). You can use such a reduction, e.g. to normalise an angle a into ±90° with ○/¯1 1 a
the question is, of course, if you can only do 50-50 splits, but you can recursively do 50-50 splits, and "join" paths, is it possible to achieve a 90-10 split?
and of course that brings up the question of, given any integer value 0 <= x <= 100, is it possible to present that integer as the sum of one or more results of 100 / (2 ^ n) such that each n value can only be used once?
Enumerate Derangements
code-golfpermutationsmatharraynumber
Given some positive integer \$n\$ generate all derangements of \$n\$ objects.
Details
A derangement is a permutation with no fixed point.
The output should consist of derangements of the numbers \$(1,2,\ldots,n)\$ (or alternatively ...
personally I don't think it's strictly possible, because I tried it by hand for x = 10, and found myself very quickly adding very high n values to try and bump that 15th decimal place to a 9
but I think if there were some rounding rule it could work
@Khuldraesethna'Barya that's a damn good point actually, I didn't think about belt balancers
that google doc actually has a lot of really useful info in it, thanks!
On the topic of Compiler/Interpreter design: Is integer literal size a syntax or semantics issue? In the example of a language that doesn't support 64bit or unsigned ints, should an int literal that is >= 2 ^ 32 fail at the lexer or at the parser?
Anonymous
6:36 PM
@Skidsdev Parser
Anonymous
The value of an otherwise-valid literal is of no concern to the lexer
Maximum summed sublists with non-adjacent items
code-golfarray-manipulationnumberinteger
Introduction:
Inspired by these two SO questions (no doubt from the same class): print the elements in the subarray of maximum sum without adjacent elements java and Maximum sum of non adjacent elements of...
> Pilot was flying from IAG to FRG where it is based. It appears he attempted to land three times at FRG, but could not visualize the runway. Diverted to JFK and attempted to land twice, but still could not visualize the runway. Ran out of fuel after the second attempt and crashed into a residential neighborhood less than a mile from my house. Pilot survived and no one on the ground was injured. If he had just had another 30 seconds of fuel, he could have conceivably crashed in my backyard.
What does "could not visualize the runway" mean exactly? Does it mean visibility conditions were too poor? Or does it mean he was not fit for flying?
ah reddit comments confirm visibility was poor as there were really bad storms on the east coast last night
oddly enough one commenter mentioned they live in Ontario, Canada, and could feel the thunder shaking their desk. I didn't notice anything. Guess they live in the weird eastern part of Ontario that we don't talk about
@flawr depends if by that you mean reside in Ontario or from Ontario. I am the former, but not the latter
@Veskah fair enough, I'm not at all familiar with aviation terms and when I first read "could not visualize the runway" it sorta sounded like an incompetence thing
Your goal is to write a program that takes no input and outputs the following text:
ca e na ŋa va o sa;
þa ša ra la ła.
ma a pa fa ga ta ča;
în ja i da ða.
ar ħo ên ôn ân uħo;
carþ taŋ neŋ es nem.
elo cenvos.
But there's a catch: for each letter (any character whose general category in Unicode...
Win one for the ZIP'er
code-golf
Summary
The ZIP file format is one of the most widely used formats for data transfer, archiving and compression. It has survived as a standard and included in many free and commercial operating system and software, likely due to it's well-documented format.
C...
Ragtag Band of Misfits
(Guaging interest)
king-of-the-hill game
This is a sort of sequel to Adventurers in the Ruins, taking place in a 2D dungeon, using a multi-agent team
A group of five adventurers enters a dungeon and wants to get the best loot. There are other parties competing for loo...
The New York Times has a daily online game called Letter Boxed (the link is behind a paywall; the game is also described here), presented on a square as follows:
You are given 4 groups of 3 letters (each group corresponds to one side on the picture); no letter appears twice. The aim of the ga...
Write a program, given an input n, will generate all possible n-tuples using natural numbers.
n=1
(1),(2),(3),(4),(5),(6)...
n=2
(1,1),(1,2),(2,1),(2,2),(1,3),(3,1),(2,3),(3,2),(3,3)...
The output may be in any order.
The program must be written to run forever and list all applicable tuples ...
Enumerate Derangements
code-golfpermutationsmatharraynumber
Given some positive integer \$n\$ generate all derangements of \$n\$ objects.
Details
A derangement is a permutation with no fixed point.
The output should consist of derangements of the numbers \$(1,2,\ldots,n)\$ (or alternatively ...
Maximum summed sublists with non-adjacent items
code-golfarray-manipulationnumberinteger
Introduction:
Inspired by these two SO questions (no doubt from the same class): print the elements in the subarray of maximum sum without adjacent elements java and Maximum sum of non adjacent elements of...
Your goal is to write a program that takes no input and outputs the following text:
ca e na ŋa va o sa;
þa ša ra la ła.
ma a pa fa ga ta ča;
în ja i da ða.
ar ħo ên ôn ân uħo;
carþ taŋ neŋ es nem.
elo cenvos.
But there's a catch: for each letter (any character whose general category in Unicode...
Win one for the ZIP'er
code-golf
Summary
The ZIP file format is one of the most widely used formats for data transfer, archiving and compression. It has survived as a standard and included in many free and commercial operating system and software, likely due to it's well-documented format.
C...
Ragtag Band of Misfits
(Guaging interest)
king-of-the-hill game
This is a sort of sequel to Adventurers in the Ruins, taking place in a 2D dungeon, using a multi-agent team
A group of five adventurers enters a dungeon and wants to get the best loot. There are other parties competing for loo...
