 | 2009 |
|---|
| 9 |       | Ulisses Ferreira:
The Decidability of the Halting Problem.
FCS 2009: 180-183 |
| 2005 |
|---|
| 8 |  | Ulisses Ferreira:
The sets of real and complex numbers are denumerable.
SIGACT News 36(2): 126-130 (2005) |
| 2004 |
|---|
| 7 | | Ulisses Ferreira:
A Property for Church-Turing Thesis.
MSV/AMCS 2004: 507-513 |
| 6 | | Ulisses Ferreira:
On the Busy-Beaver Problem.
MSV/AMCS 2004: 514-518 |
| 5 | | Ulisses Ferreira:
On Turing's Proof of the Undecidability of the Halting Problem.
MSV/AMCS 2004: 519-522 |
| 4 | | Ulisses Ferreira:
The Real Set Can Be Seen As Denumerable.
MSV/AMCS 2004: 523- |
| 2003 |
|---|
| 3 | | Ulisses Ferreira:
A Novel Rôle for AI?
IC-AI 2003: 941-942 |
| 2 | | Ulisses Ferreira:
On the Foundations of Computing Science.
Metainformatics 2003: 46-65 |
| 2000 |
|---|
| 1 | | Ulisses Ferreira:
uu for Programming Languages.
SIGPLAN Notices 35(8): 20-30 (2000) |
Data released under the ODC-BY 1.0 license — See also our legal information page