OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES

E-ISSN： 1943-5886|80|4|1116-1130

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.80, Iss.4, 2015-12, pp. : 1116-1130

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Infinite time Turing machines

The Journal of Symbolic Logic, Vol. 65, Iss. 2, 2000-06 ,pp. : 567-604

Cambridge University Press

Access to resources Recommend Favorite

On the convergence of optimal solutions in infinite horizon discrete time models

By Aoki Takaaki Nishimura Kazuo

Journal of Difference Equations and Applications, Vol. 20, Iss. 5-6, 2014-06 ,pp. : 875-882

Taylor & Francis Ltd

Access to resources Recommend Favorite

Optimal control on an infinite domain

ANZIAM Journal, Vol. 47, Iss. 2, 2005-10 ,pp. : 143-153

Cambridge University Press

Access to resources Recommend Favorite

Infinite time regular synthesis

By Piccoli B.

ESAIM: Control, Optimisation and Calculus of Variations, Vol. 3, Iss. issue, 2010-03 ,pp. : 381-405

Edp Sciences

Access to resources Recommend Favorite

Eventually infinite time Turing machine degrees: infinite time decidable reals

The Journal of Symbolic Logic, Vol. 65, Iss. 3, 2000-09 ,pp. : 1193-1203

Cambridge University Press

Access to resources Recommend Favorite