I'd bet that you couldn't actually come up with a number of legal, nontrivial JAPH programs. Based on the fact that it would require you to determine whether a given set of characters from the Perl alphabet would result in not only a well-formed program, but also a program that halts. Because if your JAPH contains a loop/recursion that never halts, then it is not a JAPH. So- You could come up, rather easily, with a number of possible programs, and even reduce that by determining which characters can be placed next to other characters, ie, in english, after you write the letter 'q', you must write the letter 'u'. So, you could calculate the possible number of JAPH's that are wellformed, but not the number of JAPH's that are both wellformed and halt.
|Comment on Re^2: Infinite JAPHs?|