Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with kolmogorov-complexity
Search options not deleted
user 108687
Kolmogorov complexity, informally, is the amount of code it takes to describe or produce a constant object, such as a string or image. When posting a challenge in this category, please make sure it adds something new to existing challenges.
2
votes
Print a 10 by 10 grid of asterisks
TypeScript's Type System, 71 bytes
type F<A extends{}[]=[]>=A extends{length:10}?A:F<[...A,"**********"]>;
Try it at the TypeScript playground!
Just barely longer than Java :)
Type F recursively appe …
- 10.3k
9
votes
Golf Transmission
Japt, 25 bytes
7Ç%3?-:°U+'|³+°U÷û Õr6'R
Test it
Japt beatsties with Jelly! The Jelly submission has improved a lot, but unfortunately I don’t think this solution can.
I'll explain this part by part …
- 10.3k
1
vote
Numbers by Position
TypeScript’s type system, 94 bytes
type F<N extends 1[]=[1],L=N["length"]>=L extends 10?[]:[...{[_ in keyof N]:L},...F<[...N,1]>]
Try it at the TS Playground
- 10.3k
0
votes
1
vote
What song is playing?
Uiua, 236 bytes
G←&p$"Song: _\nArtist: _"
F←G⨬("Batman Theme""Neal Hefti"G"Na Na Hey Hey Kiss Him Goodbye""Steam"|"Africa""Toto"|"Katamari Damacy""Yuu Miyake"|"Hey Jude""The Beatles"|"Land of 1000 Dan …
- 10.3k
0
votes
Output Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo
Uiua, 25 23 bytes
↘2/$"_ _uffalo"⍥¯⋯372@B
Try it!
Take the binary digits of 372, making a B lowercase where there are ones. Reduce by inserting a space between and appending "uffalo", then drop the f …
- 10.3k
1
vote
Print the Greek alphabet!
Japt -P, 17 bytes
25od913+H*NÊ fÏÉ7
Test it
Explanation
25o map each n in range [0, 25):
d convert the following codepoint to a character:
913 …
- 10.3k
1
vote
Print the Greek alphabet!
Thunno 2 J, 17 16 15 14 bytes
24Ė17Ɗ913+C¤?L
-1 thanks to @TheThonnu :), saved 1 extra by using different method.
Explanation:
24Ė # range [0, 24]
17Ɗ # remove index 17
…
- 10.3k
2
votes
ASCII-art milk carton
Retina, 108 105 102 bytes
2*$(a+-\|/-)h2*$(b| / \ )| |¶2*$(a+/---\)h3*$(4*b| |¶)4*ah4*$( \ /)¶4*$( \_/
a
+5*-
b
|5*
h
+-+¶
Attempt This Online!
This is my first time using Retina so this can pr …
- 10.3k
2
votes
First person to ever beat Classic Tetris
Japt, 50 49 bytes
`mcnhp4 bn26 3hsvn2Ô©u6pn8t4n4v l2`qÍ®nH3ÃùT20 Õ·
Test it
My idea was to compress the 10 columns as base-3, left-pad each with zeroes to length 20, and transpose. I think this is mo …
- 10.3k
3
votes
First person to ever beat Classic Tetris
Ruby, 84 83 78 bytes
puts (?0*94+0x7241ea9db46487237308d479dcb396cc036e301ec3.to_s(3)).scan /.{10}/
Attempt This Online!
Ports Jelly, which to my surprise is extremely short in Ruby.
Previous solutio …
- 10.3k
0
votes
Sing Happy Birthday to your favourite programming language
TypeScript's type system, 96 bytes
type F<A=`
Happy Birthday `,//@ts-ignore
B=`${A}to You`>=`${B}${B}${A}dear TypeScript Types${B}`
Try it at the TypeScript playground
Outputs with a leading newline. …
- 10.3k
1
vote
First person to ever beat Classic Tetris
Vyxal 3, 32 bytes
"ṁṘkƓ₳İᵛᵂƛ»Ω7∥I»;ᶤḌᶠĖꜝ“3y₅dÞ0₀Ẇ'
Try it Online!
This is roughly a port of Nick Kennedy's Jelly answer.
- 10.3k
0
votes
Sing Happy Birthday to your favourite programming language
Japt -R, 37 36 bytes
4Æ`Happy Bir »y {XÍ?` Y `:`De Japt
Test it
-1 byte, thanks to Shaggy
Oliver's solution is very clever, this one is 2 bytes shorter but requires the R flag.
Explanation
4Æ …
- 10.3k
0
votes
Print this diamond
Uiua, 33 bytes
⊂:↘1⇌.≡(⊂⇌↘1.)⬚@ ≡°□+@1≡(□⇌⇡)+1⇡9
Try it
I’ll come back to this later and see if I can reduce it, it’s likely that I can shave off like 10 bytes
- 10.3k