it is likely that there are links between lambda calculus and Gnber Basis theory
automaticity ,measture for approximation,
Encoding languages as sets of natural numbers,the encoding functions must be c.e, computable.Then,how about the features of sets of natural numbers?
Assume Two computer or TM near different mass objects such as two stars solve same problem by same algorithm,the velocities or the times they take to solve the problem are different.Then by some communication,one computing more slowly can get the result outputed by the other computer computing faster,thus we can accelerate the computation.
There is a problem ,that is the time spent to transport the information or output from one computer to another is related to the distance between the two objects,which must be long enough to let the acceleration be possible.
How to expand automorphic function as a series with coeffecient s of integers which belong to recursive sequenceFebruary 2, 2010
How to expand autumorphic function as a series with coeffecient s of integers which belong to recursive sequence?
under what condition may a automorphic function be expanded as such a series