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 64722
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.
1
vote
We're no strangers to code golf, you know the rules, and so do I
Dart, 733 bytes
F(){var e=' give',a='ever gonna',l=" how I'm feeling",h=' you',i='(Give$h up)\n',j=' tell',k='(Ooh)\nN$a$e, n$a$e\n$i',b="""
N$a$e$h up
N$a let$h down
N$a run around and desert$h
N$a …
- 1,063
2
votes
Numbers by Position
Common Lisp, 50 bytes
(loop for x from 1 to 9 do(dotimes(n x)(write x)))
Try it online!
- 1,063
2
votes
List all possible titles for the Anno games
Dart, 103 100 96 bytes
f()=>List.generate(9001,(i)=>'$i').where((i)=>i.contains('0')&&i.runes.fold(0,(p,e)=>p+e)==201);
-3 bytes by setting the value in the array to string, making the conversion …
- 1,063
0
votes
Text compression
Dart, 124 120 117 bytes
f(){var s='Peter Piper picked',t=' peck of pickled peppers';return"$s a$t.\nA$t $s.\nIf $s a$t,\nWhere's the$t $s?";}
-4 bytes by declaring both variables on the same row
…
- 1,063
0
votes
String analyser
Dart, 83 bytes
'AWSALILAND'.runes.forEach((r)=>print(String.fromCharCodes(List.filled(r-64, r))));
Try it online!
- 1,063
0
votes
There are known knowns
Dart, 62 61 bytes
g({s='known'})=>"$s $s\s\n$s un$s\s\nun$s $s\s\nun$s un$s\s";
Try it online!
- 1,063
1
vote
Diagonal Alphabet
Dart, 65 bytes
f()=>List.generate(26,(i)=>String.fromCharCode(i+65).padLeft(i));
Try it online!
- 1,063
1
vote
Implement Minceraft
Dart, 71 bytes
import'dart:math';f()=>"Min${Random().nextInt(10000)<1?'ce':'ec'}raft";
Try it online!
- 1,063
0
votes
Alphabet Staircase
Dart, 81 bytes
List.generate(26,(i)=>''.padRight(i+1,String.fromCharCode(i+97))).forEach(print);
Try it online!
- 1,063
1
vote
1, 2, Fizz, 4, Buzz
Dart, 80 bytes
f({i=0}){for(;i++<100;)print((i%3>0?'':'Fizz')+(i%5>0?(i%3>0?'$i':''):'Buzz'));}
f({i=0}){for(;i++<100;)print("${i%3>0?'':'Fizz'}${i%5>0?(i%3>0?i:''):'Buzz'}");}
f({i=0}){for(;i++<10 …
- 1,063