Patent ID: 7720807

Claim:
A method for effectuating a string-to-numeral translation (eval), the method comprising: receiving a binary string s, the binary string s comprising one or more characters; and executing instructions stored in memory, wherein execution of the instructions by a processor converts s to an algebraic term, wherein the algebraic term is a Polish prefix term where the symbol “c” represents a constant symbol and the symbol “#” represents a binary operation symbol, wherein the symbols “x” and “y” each represents any finite natural number node labeled rooted unordered trees, wherein the Polish prefix formula includes: concatenating (Pad(s)_ 0 ) on to the right end of s, converting all occurrences of the symbol “1” in s to the binary operation symbol “#”, converting all occurrences of the symbol “0” in s to the constant symbol “c”, and wherein evaluating the resulting string includes: eval(c)=0, eval(#cc)=1, eval(#xc)=q(Eval(x minus )), wherein x is an ordinal string, eval(#xc)=q(Eval(x)), wherein x is not an ordinal string, eval(#xy)=(q(Eval(x))*Eval(y plus )), wherein y is an ordinal string, eval(#xy)=(q(Eval(x))*Eval(y), wherein y is not an ordinal string, wherein q is a monadic operation defined on natural numbers that lists in order the prime natural numbers.