DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY.
| Autor: | Byerly, Robert E.1 |
|---|---|
| Zdroj: | Mathematical Logic Quarterly. 1984, Vol. 30 Issue 32-34, p499-503. 5p. |
| Databáze: | Academic Search Ultimate |
| Externí odkaz: |
|
| Autor: | Byerly, Robert E.1 |
|---|---|
| Zdroj: | Mathematical Logic Quarterly. 1984, Vol. 30 Issue 32-34, p499-503. 5p. |
| Databáze: | Academic Search Ultimate |
| Externí odkaz: |
|