Theory and Applications of Models of Computation
-
Theory and Applications of Models of Computation: Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings
By Jin-Yi CaiB ̈urgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, Vol. 315, Springer Verlag, 1997. 5. Cheraghchi, M.: On Matrix Rigidity and the Complexity of Linear Forms.
-
Theory and Applications of Models of Computation
By S. Barry Cooper Jianer ChenTheory and Applications of Models of Computation
-
Theory and Applications of Models of Computation: 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings
By Jin-Yi Cai... Xiaoshuang 760 Xu, Yatao 100 Xu, Zhiwei 715 Yamasaki, Hitoshi 67 Yang, Bing 46 Yang, Boting 136 Yang, Shih-Cheng 274 Yang, Yi-Chuan 244 Yao, Andrew C.C. 462, 474 Yao, Frances F. 284, 462, 474 Yi, Jin 374 Yoneda, Harumasa 511 Yong, ...
-
Theory and Applications of Models of Computation: 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings
By Barry S. Cooper, Jianer ChenDirections in recursion theory, pp. 1–60. Cambridge University Press, Cambridge (1996) [ASM97] Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. In: Sorbi, A. (ed.) Complexity, Logic and Recursion Theory, pp.
-
Theory and Applications of Models of Computation: 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings
By Gerhard Jäger, T.V. Gopal, Silvia SteilaFurthermore, for a tuple the ̄b from formula L, φ ̄a ( is logically equivalent to a computable Σ2β+1 formula. We use the effective procedure for ... Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy.
-
Theory and Applications of Models of Computation: 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings
By Jin-Yi Cai, Barry S. Cooper, Hong ZhuIf no such i exists, then s is a halting state for f, and we will establish the convention that Ff(s) = s. The FracTran program f computes a partial function Ff(x) by starting with state s0 = 2x+1, and halting in state 3Ff(x)+1.