probabilistic methods in algorithmic discrete mathematics - springer

... program interpreter for Turing machines. The interpreter will execute any Turing machine with a single two-way infinite tape. We’ll make the following assumptions about any Turing machine that ... test a multi-tape Turing machine interpreter that executes any Turing machine having one or more tapes. Use a goal of the following type to execute such a Turing machine. | ?- compute(Input,...

... Stat. Methods in Cryptology, LNCS 3028, pp. 1-7 , 2004.  Springer- Verlag Berlin Heidelberg 2004 2 Introduction was thought to be “unbreakable” for centuries. This code will be presented in Section ... consult, in particular, the Journal of Cryptology and the various confer- ence proceedings series, e.g., in the Springer Lecture Notes in Computer Sci- ence (EUROCRYPT, CRYPTO...

... Theorem Proving in Geometries: Basic Principles. Springer- Verlag, Berlin, 1994. (Trans. from Chinese by X. Jin and D. Wang). [26] K. Yokoyama, M. Noro, and T. Takeshima. On determining the solvability ... standard terminology for ordinary complexity functions to intrinsic functions. Thus U + T, UT, U T ,U◦ T (13) denote intrinsic functions in the natural way. For instance, U + T denotes...

... algorithm. Finally, we apply it to various PDEs in 1 + 1 dimensions, mostly taken from physics, some of them chaotic: sine-Gordon, Boussinesq, Sawada-Kotera, Kaup-Kupershmidt, com- plex Ginzburg-Landau, ... BT is called the auto-BT or the hetero-BT according as the two PDEs are the same or not. Example 2.2. The sine-Gordon equation (we identify sine-Gordon and sinh- Gordon since an affine tra...