Any Turings out there?
Discussion
I use a substitution cipher algorithm in my work which gives most likely answers, for this there were lots of answers but the simplest algorithm gave the answer that it is a conversion of each letter to a number 1=A 26 = Z then multiply the first number by 2 add the two together and then see what number it gives as the answer, if above 26 then count back down again the relevant number from 26. to be more accurate more was needed as then the results can be compared to a dictionary to see if words result from the decode.
bill swizz said:
I use a substitution cipher algorithm in my work which gives most likely answers, for this there were lots of answers but the simplest algorithm gave the answer that it is a conversion of each letter to a number 1=A 26 = Z then multiply the first number by 2 add the two together and then see what number it gives as the answer, if above 26 then count back down again the relevant number from 26. to be more accurate more was needed as then the results can be compared to a dictionary to see if words result from the decode.
Interesting, thanks. In other words the code/question combination is too simple to have only one answer!Simpo Two said:
Interesting, thanks. In other words the code/question combination is too simple to have only one answer!
It has infinitely many, but normally with problems like this there is an unspoken convention behind them that the answer is one of the simpler rules that conforms to the earlier examples.I still can’t see it in this case.
Just got this from the culprit: 'The key is Morse Code. A is dot dash and N is dash dot put them together and get dot dash dash dot which is P. Put them together the other way round and it it dash dot dot dash which is X. Follow the logic through and the answers are Y and J respectively.'
Good job Jerry didn't use it eh!
Good job Jerry didn't use it eh!
Gassing Station | Science! | Top of Page | What's New | My Stuff