MFCS
2000
Springer
15 years 7 months ago
2000
Springer
128
click to vote
MFCS
2000
Springer
15 years 7 months ago
2000
Springer
We introduce explicit fusions of names. To `fuse' two names is to declare that they may be used interchangeably. An explicit fusion is one that can exist in parallel with som...
105
click to vote
MFCS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...