Eventually infinite time Turing machine degrees: infinite time decidable reals

E-ISSN： 1943-5886|65|3|1193-1203

ISSN： 0022-4812

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

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

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

Infinite Divisibility for Stochastic Processes and Time Change

By Barndorff-Nielsen Ole Maejima Makoto Sato Ken-iti

Journal of Theoretical Probability, Vol. 19, Iss. 2, 2006-06 ,pp. : 411-446

Springer Publishing Company

Access to resources Recommend Favorite

An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes

By Gault Richard L.

Theory of Computing Systems, Vol. 39, Iss. 5, 2006-09 ,pp. : 753-783

Springer Publishing Company

Access to resources Recommend Favorite

OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES

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

Cambridge University Press

Access to resources Recommend Favorite