Results 1 to 10 of about 5,016 (80)

The prospects for mathematical logic in the twenty-first century [PDF]

, 2001
The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed ...
Alexander S. Kechris, Anand Pillay, Richard A, Richard A. Shore, Samuel R. Buss   +4 more
core   +3 more sources

A Swiss Pocket Knife for Computability [PDF]

, 2013
This research is about operational- and complexity-oriented aspects of classical foundations of computability theory. The approach is to re-examine some classical theorems and constructions, but with new criteria for success that are natural from a ...
Jones, Neil D.
core   +3 more sources

Computability of simple games: A characterization and application to the core [PDF]

, 1995
The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions.
A Renzini, BE Pagel, D Reimers, DR Garnett, DR Garnett, E Anders, ED Skillman, K Olofsson, MB Vila-Costas, MG Edmunds, X Fan, YI Izotov   +11 more
core   +6 more sources

Banach Spaces as Data Types [PDF]

, 2010
We introduce the operators "modified limit" and "accumulation" on a Banach space, and we use this to define what we mean by being internally computable over the space.
Dag Normann, Ning Zhong
core   +2 more sources

Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals [PDF]

, 2009
We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the application of
Coskey, Samuel, Hamkins, Joel David
core   +1 more source

A Survey on Continuous Time Computations [PDF]

, 2007
We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models.
A Ben-Hur, A Ben-Hur, A Ben-Hur, A Ben-Hur, A Kempe, A Rabinovich, A Turing, A Vergis, A. Church, APL Francisco, Asarin, B Trakhtenbrot, BJ Copeland, C Moore, C Moore, C Moore, C Moore, CE Shannon, CS Calude, D Dee, D Deutsch, D Graça, D Woods, DS Graça, DS Graça, E Asarin, E Asarin, E Asarin, E Post, EB Davies, G Etesi, G Lafferriere, G P ăun, H Abdi, HM Stoll, HT Siegelmann, HT Siegelmann, HT Siegelmann, I Artobolevskii, I Németi, J Earman, J Foy, J Mycka, J Mycka, J Mycka, J Mycka, J Šíma, J Šíma, JF Costa, JJ Hopfield, JJ Hopfield, JV Tucker, K Ruohonen, K Ruohonen, K Ruohonen, K Ruohonen, K Ruohonen, K Ruohonen, K Weihrauch, K-I Ko, K-I Ko, L Blum, L Faybusovich, L Faybusovich, L Lipshitz, LA Rubel, LA Rubel, LM Adleman, M Campagnolo, M Campagnolo, M Casey, M Casey, M Davis, M Gori, M Hogarth, M Hogarth, M Hoyrup, M Pour-El, MB Pour-El, MB Pour-El, MB Pour-El, MD Bowles, ML Campagnolo, ML Campagnolo, ML Hogarth, MO Rabin, MS Branicky, MS Branicky, N Müller, O Bournez, O Bournez, O Bournez, O Bournez, O Bournez, O. Finkel, P Bouyer, P Clote, P Collins, P Koiran, P Koiran, P Koiran, P Orponen, P Orponen, PW Shor, R Alur, R Alur, R Legenstein, RJ Lipton, RW Brockett, RW Brockett, S Aaronson, S Grigorieff, S Omohundro, S. C. Kleene, T Brihaye, T Brihaye, T Head, T Natschläger, TA Henzinger, TD Kieu, U Helmke, V Bush, VD Blondel, VD Blondel, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, W Maass, WD Smith, Šíma   +138 more
core   +5 more sources

Monoidal computer III: A coalgebraic view of computability and complexity [PDF]

, 2018
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a much needed ...
A Church, AM Turing, AM Turing, B Jacobs, B Klin, D Pavlovic, D Pavlovic, D Pavlovic, D Pavlovic, D Pavlovic, E Moggi, G Winskel, H Rogers Jr, HH Hansen, J Lambek, J Neumann von, J Robin, J Robin, JJMM Rutten, M Barbieri, M Bartha, M Blum, MM Bonsangue, ND Jones, PJW Hofstra, R Bruni, R Hoofman, RA Paola Di, S Hayashi, S Mac Lane, SC Kleene, WML Holcombe, YN Moschovakis   +32 more
core   +2 more sources

Exhaustible sets in higher-type computation [PDF]

, 2008
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which the predicate ...
Andrew Pitts, Martin Escardo
core   +2 more sources

Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types [PDF]

, 2014
In this paper, we present an Agda formalization of a normalizer for simply-typed lambda terms. The normalizer consists of two coinductively defined functions in the delay monad: One is a standard evaluator of lambda terms to closures, the other a type ...
Abel, Andreas, Chapman, James
core   +2 more sources

The computational content of Nonstandard Analysis [PDF]

, 2016
Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on the so-called unwinding of proofs.
Sanders, Sam
core   +3 more sources