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 83321
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
Display numbers lacking 2's
Haskell, 57 Bytes
Solution
import Data.List
unlines.nub.map(filter(/='2').show).$[1..100]
or
import Data.List
nub.map(filter(/='2').show)$[1..100]
if you just want the list.
Output
Prelude Da …
- 311
1
vote
List all possible titles for the Anno games
Haskell, 66 79 74 bytes
drop 55[x>>=show|x<-sequence.replicate 4$[0..9],sum x==9,elem 0x]
Damn you with your type juggling, you can treat numbers as strings :(
Basically just an exact description …
- 311