Asat Arslanov

According to our database, Asat Arslanov authored at least 5 papers between 1995 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

On Elementary Computability-Theoretic Properties of Algorithmic Randomness.

Asat Arslanov

Proceedings of the Computing: The Australasian Theory Symposium, 2001

2000

On the phenomenon of autocomputability.

Asat Arslanov

Proceedings of the Computing: the Australasian Theory Symposium, 2000

1997

Difference Splittings of Recursively Enumerable Sets.

Asat Arslanov

J. Univers. Comput. Sci., 1997

On a Conjecture of M. Van Lambalgen.

Asat Arslanov

Bull. EATCS, 1997

1995

Program-size Complexity Computes the Halting Problem.

Gregory J. Chaitin, Asat Arslanov, Cristian Calude

Bull. EATCS, 1995