> The purpose of this project is to try to build up many layers of abstraction, all compiling down to Brainfuck, with the ultimate intention that Brainfuck will be able to be used for more complex things.
How feasible would be a processor/computer performing only 8 brainfuck operations () provided we have a smart high_level_language-to-brainfuck translator?
There doesn't appear to be any loopholes - if language A is a trivial extension, then it's more difficult to come up with a compiler (theoretically speaking).
so how about this: language A can only have stacks, language B can only have queues, Language C can have neither stacks nor queues, language D can have only stacks, etc.
@Qwerp-Derp but that takes the language design out of it
There is a similar idea though which is a program that when run in language A outputs program B, when run in language B outputs program C, etc. and eventually loops back to the original after 150 languages
Also, when did everyone here wake up, out of curiosity? It seems like most of you are probably not American teenagers because no teenager could be up this early.
you may or may not need to be careful with the kinds of things you allow just in case you make it impossible to make a higher level language with that capability
@isaacg, I'm changing this to fastest-code... Do you mind sharing the specs (and limitations) of your computer here (if it's still OK for you to do the testing).
A proper divisor is a divisor of a number n, which is not n itself. For example, the proper divisors of 12 are 1, 2, 3, 4 and 6.
You will be given an integer x, x ≥ 2, x ≤ 1000. Your task is to sum all the highest proper divisors of the integers from 2 to x (inclusive).
Example (with x = 6):
...
This challenge is inspired by this app.
This is a much easier version of this challenge. This challenge is code-golf, while the other one is fastest-code.
You'll be given a square input grid, of dimensions 6-by-6 which is divided into 6 areas, where the cells of each area has a unique ident...
Incremental Ranges!
code-golfsequencelist
Your task is to, given a positive integer n, return the first 100 (or more) numbers in the incremental ranges sequence, where each range is length 4.
The incremental range sequence first generates a range from one to n inclusive. For example, if n was ...
A knight fill is a flood fill using the connectivity of the knight chess piece. Specifically:
1 1
1 1
0
1 1
1 1
(0 is the initial point, 1s show the connected cells)
Challenge
Given a 2D grid of spaces and walls, and an initial location, perform a knight-fill on the grid. Shortest co...
I tried to invent a sequence for a code golf challenge, but every time I came up with one, I accidentally created an alternate definition of Fibonacci numbers. >_>
A proper divisor is a divisor of a number n, which is not n itself. For example, the proper divisors of 12 are 1, 2, 3, 4 and 6.
You will be given an integer x, x ≥ 2, x ≤ 1000. Your task is to sum all the highest proper divisors of the integers from 2 to x (inclusive).
Example (with x = 6):
...
This challenge is inspired by this app.
This is a much easier version of this challenge. This challenge is code-golf, while the other one is fastest-code.
You'll be given a square input grid, of dimensions 6-by-6 which is divided into 6 areas, where the cells of each area has a unique ident...
Incremental Ranges!
code-golfsequencelist
Your task is to, given a positive integer n, return the first 100 (or more) numbers in the incremental ranges sequence, where each range is length 4.
The incremental range sequence first generates a range from one to n inclusive. For example, if n was ...
A knight fill is a flood fill using the connectivity of the knight chess piece. Specifically:
1 1
1 1
0
1 1
1 1
(0 is the initial point, 1s show the connected cells)
Challenge
Given a 2D grid of spaces and walls, and an initial location, perform a knight-fill on the grid. Shortest co...
