A Limiting First Order Realizability Interpretation

Cached

Download Links

by Masahiro Nakata , Susumu Hayashi
Citations:5 - 0 self

Active Bibliography

3 Towards Limit Computable Mathematics – Susumu Hayashi, Masahiro Nakata
4 Can proofs be animated by games? – Susumu Hayashi - 2005
18 Infinitary Self Reference in Learning Theory – John Case - 1994
6 On the Turing degrees of weakly computable real numbers – Xizhong Zheng, Theoretische Informatik - 1986
The n-r.e. degrees: undecidability and Σ1 substructures – Mingzhong Cai, Theodore A. Slaman, Richard A. Shore - 2012
Inductive Inference of ... vs. ...-Definitions for Computable Functions – John Case, Mandayam Suraj, Ayam Suraj - 2002
34 On the computational content of the axiom of choice – Stefano Berardi, Marc Bezem, Thierry Coquand - 1998
15 The New AI: General & Sound & Relevant for Physics – Jürgen Schmidhuber - 2003
38 Hierarchies Of Generalized Kolmogorov Complexities And Nonenumerable Universal Measures Computable In The Limit – Jürgen Schmidhuber - 2000
1 The New AI is General & Mathematically Rigorous – Jürgen Schmidhuber
The Fastest Way of Computing All Universes – Jürgen Schmidhuber
31 Algorithmic Theories Of Everything – Jürgen Schmidhuber - 2000
1 Metamathematical Properties of Intuitionistic Set Theories with Choice Principles – Michael Rathjen
6 Realizability for constructive Zermelo-Fraenkel set theory – Michael Rathjen - 2004
Computability and analysis: the legacy of Alan Turing – Jeremy Avigad, Vasco Brattka - 2012
I Basic Categories 6 – J. R. B. Cockett - 2010
20 Computational Foundations of Basic Recursive Function Theory – Robert L. Constable, Scott Fraser Smith - 1988
4 Introduction to Turing categories – J. R. B. Cockett, Pieter J. W. Hofstra
Domain-Theoretic Methods for Program Synthesis – Ulrich Berger