May 6, 2015 · Every decidable set is almost decidable, but the converse implication is false. We prove the existence of infinitely many universal functions ...

Aug 28, 2017 · Abstract. We present and study new definitions of universal and programmable universal unary functions and.

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the ...

We prove the existence of infinitely many universal functions whose halting sets are generic (negligible, i.e. have density zero) and (not) almost decidable.

Aug 28, 2017 · Every decidable set is almost decidable, but the converse implication is false. We prove the existence of infinitely many universal functions ...

It is proved the existence of infinitely many universal functions whose halting sets are generic negligible, i.e. have density zero and not almost decidable ...

Jan 1, 2015 · Every decidable set is almost decidable, but the converse implication is false. We prove the existence of infinitely many universal functions ...

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the ...

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the ...

We prove the existence of infinitely many universal functions whose halting sets are generic (negligible, i.e. have density zero) and (not) almost decidable.