CMQ: Do you have a question you think was underappreciated (in terms of votes/# of answers/etc.)? If so, tell me which one, and I'll be happy to give it a try, see if a new answer can draw some more attention
Inspired by this excellent challenge (from which the bulk of this text is blatantly duct-taped) – and my highschool philosophy project...
I define the following operators:
Fuzzy Conjunction a ×F b is a × b
Fuzzy Division a ÷F b is a ÷ b
Fuzzy Negation –F b is 1 – b
Fuzzy Disjunction a +F b i...
@Adám Does "extend the language of your choice to include the notation." mean that I can define 4 functions that take the necessary arguments and return the correct results?
@cairdcoinheringaahing That'd only be valid if you can get the required infix syntax into your language. Otherwise the whole thing becomes rather trivial.
@cairdcoinheringaahing I'd say it is almost acceptable. Can you insert some string substitution preprocessing before you eval-as-Jelly? Then you can actually use ×F etc. in the code.
@Adám Given that it's getting late here and that Jelly hates 2-letter substitution more than I expected, I might have to give it a proper go tomorrow. I'll delete my answer until I get it tho
@cairdcoinheringaahing That's an interesting question. I've also not specified internal spacing, though all my examples have a single space between tokens. I guess I'll allow it, though I can't imagine it takes a lot of Jelly to append a space, does it?
@ngn the cheesy way to convert nfa to dfa is to have 2^n states where each DFA state is a sum of powers of 2 of the states that the nfa might be in at the time
@Neil right, that can work. for this challenge it's easy to construct of an nfa with 3*(n+1) states, where n is at most 16. so bitmasks can fit in 64 bits.