:29810903 don't post this stuff without context. you were pretty close to getting flag suspended. next time I won't deleted it before the flags fill up.
Alright, I'm looking for advice. There will be 4 "replace" functions in V. First on current line, all on current line, first on every line, and all on every line. What should they be? Two of them will be ó an Ó, but what should the other two be?
Count without 3
Background
When I was in elementary school, we used to play a game in math class that goes as follows.
All kids sit in a big circle and take turns counting, starting from 1.
However, the following numbers must be skipped while counting:
Numbers that are multiples of 3.
Numb...
The game of Sevens is played as follows: n players sit in a circle, and start counting up from 1, passing to the left (or from player A to player B).
When a number p that has a 7 in it OR is divisible by 7 is reached, then the player who spoke the number p-1, after the next player says p, must s...
yes, i'm recoding his brain to use smarter algorithms and all that good stuff
right now he's using really naive methods to approximate the most relevant response from a given set of messages. I want him to be able to make his own messages
@wizzwizz4 I like how there's a rough Normal distribution showing up already...
@wizzwizz4 That recaptcha may be a little region specific. Here in the UK I wasn't sure if I should identify as "tea" only the drink when presented with tea in cups and trays of cakes
Volume in drive C is TI10693600D
Volume Serial Number is 0C1C-0772
Directory of C:\Users\Conor O'Brien\Documents\Programming\Variations of Game of
Life
04/14/2016 19:31 <DIR> .
04/14/2016 19:31 <DIR> ..
02/25/2016 22:30 6,651 extension.js
02/23/2016 22:30 6,072 new 17.js
04/14/2016 19:31 2,552 ti 84.js
04/14/2016 19:31 1,212 ti 84.txt
4 File(s) 16,487 bytes
2 Dir(s) 871,196,598,272 bytes free
If you're not sure whether a challenge is substantial enough to be a good fit for main, just sandbox it. Then if it has a good response you can tidy it up ready to post...
@LeakyNun I don't think there is a number of answers that can be attained that justifies deleting a challenge, so by the same logic existing answers shouldn't be a reason not to post.
@LeakyNun J, 17 bytes: ".@($&'!'@[,":@]). I'm still figuring out how to use a conjunction in tandem with input. Perhaps an explicit verb would do that.
Apply factorial y times
tags: code-golf
Your challenge is simple: given positive integers x and y, output the result of the application of factorial to x for y times.
Shortest code wins.
Test cases
from: 1, 1
to: 1
from: 3, 2
to: 720
Needs more test cases, and clarification, I thin...
@zyabin101 I don't have a preference either way - it just needs to be defined to avoid arguments later...
@zyabin101 Does that exclude languages which don't have datatypes larger than 255? Or is there an exception for them?
@CᴏɴᴏʀO'Bʀɪᴇɴ I can't think of a way it could be abused either - just trying to make sure the rules are unambiguous. I had a look through meta but I can't find anything to say whether a particular numerical type should be assumed per language
@trichoplax most people use contractions in normal speech which is why I'm adding support to Chatgoat for it. I know Chatgoat should be learning these rules, but there are too many exceptions in the english language to completely confuse my goat
Recently I have been writing a chatbot, and in part of the process it is expands contractions. While doing this, I have found odd behavior for the contraction isn't. They are two different way to expand this contraction:
isn't this great -> is this not great?
or:
what isn't great -> what is n...
> Nonetheless, it is essential in some cases to explicitly model the probability of out-of-vocabulary words by introducing a special token (e.g. <unk>) into the vocabulary
To people who know some maths, are you aware of any sort of theoretical results about functions of the form f^-1 g f where f is any (computable) bijective function and g is some arbitrary function? What field of maths would I even be looking for?
@MartinBüttner I don't expect to be much help with an answer, but to clarify the question, do you just want a g such that f^-1 g f has an output for everything in the domain of g, or do you want a g such that for every bijective function there exists an f such that f^-1 g f is the bijective function?
okay, is it possible to construct a bijective function on the integers which, interpreted as a permutation, has infinitely many cycles of any length (including infinite length)?
If we were just dealing with f^-1 g or g f then I can't see why anything more than bijectivity would be required, but I can't get a grasp on how f^-1 g f would would be affected
Count without 3
Background
When I was in elementary school, we used to play a game in math class that goes as follows.
All kids sit in a big circle and take turns counting, starting from 1.
However, the following numbers must be skipped while counting:
Numbers that are multiples of 3.
Numb...
Apply factorial y times
tags: code-golf
Your challenge is simple: given positive integers x and y, output the result of the application of factorial to x for y times.
Shortest code wins.
Test cases
from: 1, 1
to: 1
from: 3, 2
to: 720
Needs more test cases, and clarification, I thin...
Recently I have been writing a chatbot, and in part of the process it is expands contractions. While doing this, I have found odd behavior for the contraction isn't. They are two different way to expand this contraction:
isn't this great -> is this not great?
or:
what isn't great -> what is n...
