Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Claude Sureson"'
Autor:
Claude Sureson
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 2 (2017)
The notion of Schnorr randomness refers to computable reals or computable functions. We propose a version of Schnorr randomness for subcomputable classes and characterize it in different ways: by Martin L\"of tests, martingales or measure computable
Externí odkaz:
https://doaj.org/article/a4b3708b0f5f49a5a89e623e3ed0f7eb
Autor:
Claude Sureson
Publikováno v:
Fundamenta Informaticae. 182:345-361
We propose a detailed proof of the fact that the inverse of Ackermann function is computable in linear time.
20 pages
20 pages
Autor:
Claude Sureson
Publikováno v:
Theoretical Computer Science. 891:59-83
We propose notions of effective Hausdorff function dimension for subcomputable classes such that while the classical numerical Hausdorff dimension notions coincide as shown by Downey, Merkle and Reimann for Computable and Schnorr dimensions, the corr
Autor:
Claude Sureson
Publikováno v:
Mathematical Logic Quarterly. 65:265-279
Autor:
Claude Sureson
Publikováno v:
Theoretical Computer Science. 653:26-41
Hjorth and Nies proposed notions of randomness corresponding to the higher recursion setting. In particular, they defined the notion of Π 1 1 -Martin-Lof randomness. In this article we present examples of Π 1 1 -Martin-Lof random reals which are ob
Autor:
Claude Sureson
Publikováno v:
Theoretical Computer Science. 589:1-23
We elaborate a recursion-theoretic method to define real numbers which are random to any jump of the halting problem. This is obtained by generalizing a result of V. Becher and G. Chaitin dealing with the class of cofinite sets. As in the work of V.
Autor:
Claude Sureson
Publikováno v:
Archive for Mathematical Logic. 48:403-420
Extending the language of rings to include predicates for Jacobson radical relations, we show that the theory of regular rings defined by Carson, Lipshitz and Saracino is the model completion of the theory of semisimple rings. Removing the requiremen
Autor:
Claude Sureson
Publikováno v:
Annals of Pure and Applied Logic. 145(2):204-222
We continue the study of a theory which is a valued analogue of the theory of regular rings studied by Carson, Lipshitz and Saracino, characterize it as the model companion of the theory of (extended) Prufer rings, and prove its decidability. We then
Autor:
Claude Sureson
Publikováno v:
Annals of Pure and Applied Logic. 135:210-242
We propose two theories, one generalizing the notion of regularity, the other symmetric to it. Under two additional axioms (as for the Carson–Lipshitz–Saracino theorems) one obtains model completeness of both theories. Models of these theories ca
Autor:
Claude Sureson
Publikováno v:
Revue d'histoire des sciences. 52:107-138
SUMMARY. — The status of contemporary Set Theory is examined through its different forms of exposition.
RÉSUMÉ. — Cette étude interroge le statut de la Théorie des Ensembles contemporaine à travers une analyse de ses différentes formes
RÉSUMÉ. — Cette étude interroge le statut de la Théorie des Ensembles contemporaine à travers une analyse de ses différentes formes