Titlebook: Evolving Computability; 11th Conference on C Arnold Beckmann,Victor Mitrana,Mariya Soskova Conference proceedings 2015 Springer Internation

基因組

Some Results on Interactive Proofs for Real Computationsizes the class IP as PSPACE or, equivalently, as PAT and PAR in the Turing model. Since space resources alone are known not to make much sense in real number computations the question arises whether IP can be similarly characterized by one of the latter classes. Ivanov and de Rougemont [.] started t

路標(biāo)

-Recognizability from Random Oracleshe analogous statement for non-meagerness instead of positive Lebesgue measure - has been shown to carry over to many models of transfinite computations in [.]. Here, we start exploring another analogue concerning recognizability rather than computability. We show that, for Infinite Time Register Ma