Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Hi-index | 0.00 |
Using Church's thesis on recursiveness of m-ary relations of integer numbers and methods for existence of solutions for Diophantine equations, the conditions on the computability of some important digital input output models are demonstrated.