Kov

Kov ([K]olmon[o]gro[v]) is a simple language invented by User:A inspired by Kolmonogrov-complexity challenges.

Kolmogorov complexity

In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. For example, the string "abababababababababababababababababababab" has a low Kolmogorov complexity because it can be produced with a simple loop:

take 40 $ cycle "ab"

Written in Kov:

"ab;(*

Explanation:

"ab    # Two-byte string
   ;(  # One-byte integer whose ASCII code is 40
     * # Repetition

Since ( is currently not a valid command, golfing into:

"ab   # Two-byte string
   (  # One-byte integer whose ASCII code is 40
    * # Repetition

Possible submissions

Output the list of musical notes

Output this:

Ab A A# Bb B C C# Db D D# Eb E F F# Gb G G# 

`ABCDEFG``b°#`c

Explanation:

`ABCDEFG`       # A to G
         `b°#`  # Permutation with b, null character, and #
              c # Return all possible combinations separated with spaces by default

Possible golfed program:

~A…G~b°#;P

Explanation:

~          # String-in-row
 A…G       # String 1: ASCII code from A to G
    ~b°#   # String 2: b, null, and #
        ;  # End string-in-row
         c # Return all possible combinations

Print beep boop bop

~b~`"ee"oo'o`'p;c;c