@meowkoteeq AI assistance is a force multiplier. If the developer themselves brings little to the table, AI probably won't have that much of an impact.
@AtelierElysara@Hsirah6991 I think the main point is it being tender, juicy, and full of flavor, no? How we get there is of little matter most of the time.
@movieguyjon Session Zero it, man. You need to be in tune with how the players want to play or find other players.
With that in mind, I strongly encourage you to ask them if they would like their game to be boring and anticlimactic but let the dice rule everything.
@ScionofCulture I think in the case of the Tolkien orcs it's significantly simpler: all the orcs encountered during the story are enemy combatants. It's not a species thing, it's them working for the bad guy. Who knows? Maybe there's a group of orcs out there who don't fight for Sauron.
@walkdotdv@DrWinBougie@millerman Oh, shit. I was going to suggest sequences of infinite finite-length sentences, but apparently even that's not necessary. There are valid sentences in the English language with infinite length due to the concept of recursion within it.
@walkdotdv@DrWinBougie@millerman No disagreement there. You provided a definition and I'm following it. But that definition then makes utterances not encompass the totality of the English Language.
@walkdotdv@DrWinBougie@millerman Makes sense, given the definition of "utterance" as a finite sequence. But English is very much capable of producing infinite sequences.
@walkdotdv@DrWinBougie@millerman So it's a matter of definition. They have to be finitely long. That doesn't seem to encompass the whole of the English language, though.
@yashv_singh@millerman A single one, yes. But all the combinations of characters in a finite alphabet are uncountable. Right? And that group seems closer to language than a single combination of characters.
@RezabekA@wowAwesomeness@millerman There is one to produce them, at least. My confusion is more of terminology. Is "listing" something the same as counting it?
@RezabekA@wowAwesomeness@millerman Wait. This is where I get a bit lost. Isn't there a naive algorithm for this? The issue is that it doesn't halt. It would take an uncountable number of steps and time.