|
3
|
Can proofs be animated by games?
– Susumu Hayashi
- 2005
|
|
6
|
On the Turing degrees of weakly computable real numbers
– Xizhong Zheng, Theoretische Informatik
- 1986
|
|
17
|
Infinitary Self Reference in Learning Theory
– John Case
- 1994
|
|
|
Inductive Inference of ... vs. ...-Definitions for Computable Functions
– John Case, Mandayam Suraj, Ayam Suraj
- 2002
|
|
28
|
On the computational content of the axiom of choice
– Stefano Berardi, Marc Bezem, Thierry Coquand
- 1998
|
|
6
|
The New AI: General & Sound & Relevant for Physics
– Jürgen Schmidhuber
- 2003
|
|
30
|
Hierarchies Of Generalized Kolmogorov Complexities And Nonenumerable Universal Measures Computable In The Limit
– Jürgen Schmidhuber
- 2000
|
|
21
|
Algorithmic Theories Of Everything
– Jürgen Schmidhuber
- 2000
|
|
|
Metamathematical Properties of Intuitionistic Set Theories with Choice Principles
– Michael Rathjen
|
|
5
|
Realizability for constructive Zermelo-Fraenkel set theory
– Michael Rathjen
- 2004
|
|
|
I Basic Categories 6
– J. R. B. Cockett
- 2010
|
|
19
|
Computational Foundations of Basic Recursive Function Theory
– Robert L. Constable, Scott Fraser Smith
- 1988
|
|
1
|
Introduction to Turing categories
– J. R. B. Cockett, Pieter J. W. Hofstra
|
|
|
Domain-Theoretic Methods for Program Synthesis
– Ulrich Berger
|
|
1
|
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory
– Robert I. Soare
- 2009
|
|
7
|
Effective Applicative Structures
– Andrea Asperti, Agata Ciabattoni, Piazza Porta, S. Donato
- 1995
|
|
|
On Completability of Partial
– Andrea Asperti, Agata Ciabattoni
|
|
|
Interpolating d-r. e. and REA degrees between r. e. degrees
– Marat Arslanov, Richard A. Shore
- 1995
|
|
|
Creativity, the Turing Test, and the (Better) Lovelace Test
– Selmer Bringsjord, Paul Bello, David Ferrucci
- 2000
|
