1 |
Formalizing Abstract Computability: Turing Categories in Coq
|
|
|
|
BASE
|
|
Show details
|
|
4 |
Emergence as a Computability-Theoretic Phenomenon
|
|
|
|
In: http://www.amsta.leeds.ac.uk/Pure/staff/cooper/preprints/EACTP.pdf (2008)
|
|
BASE
|
|
Show details
|
|
5 |
Extending and Interpreting Post’s Programme
|
|
|
|
In: http://www.amsta.leeds.ac.uk/Pure/staff/cooper/preprints/cooper.apal.final.pdf (2008)
|
|
BASE
|
|
Show details
|
|
6 |
The Turing Closure of an Archimedean Field
|
|
|
|
In: ftp://dotto.usr.dsi.unimi.it/users/vigna/TuringClosure.ps.gz (1997)
|
|
BASE
|
|
Show details
|
|
7 |
Feedback Turing Computability, and Turing Computability as Feedback
|
|
|
|
In: http://math.mit.edu/%7Efreer/papers/AckermanFreerLubarsky-FeedbackMachines-LICS.pdf
|
|
BASE
|
|
Show details
|
|
|
|