Computability

Results: 1315



#Item
111Theoretical computer science / Quantum computing / Quantum information science / Computational complexity theory / Quantum algorithm / Algorithm / Computational geometry / Computational mathematics / Complexity / Quantum simulator / Art gallery problem

CEOC Centro de Estudos em Optimização e Controlo (Centre for Research in Optimization and Control) Computability and Algorithms

Add to Reading List

Source URL: ceoc.mat.ua.pt

Language: English - Date: 2008-07-17 10:24:20
112Ordinal numbers / Type theory / Computability theory / Recursion / Constructible universe / Lambda calculus / Standard ML / Recursive data type / Fold / CurryHoward correspondence

Truly Modular (Co)datatypes for Isabelle/HOL Jasmin Christian Blanchette1 , Johannes Hölzl1 , Andreas Lochbihler2 , Lorenz Panny1 , Andrei Popescu1,3 , and Dmitriy Traytel1 1 3

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-01-25 16:18:54
113Mathematical logic / Mathematics / Computability theory / Logic / Philosophy of mathematics / Foundations of mathematics / Reverse mathematics / Constructivism

Emanuele Frittaion Curriculum Vitae 2016

Add to Reading List

Source URL: www.math.tohoku.ac.jp

Language: English - Date: 2016-05-17 18:40:36
114Proof theory / Computability theory / Logic in computer science / Mathematical logic / Intuitionism / Primitive recursive functional / Dialectica interpretation / Peano axioms / Second-order arithmetic / Reverse mathematics / Combinatory logic / Primitive recursive arithmetic

TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS ALEXANDER P. KREUZER AND ULRICH KOHLENBACH Abstract. In this paper we study with proof-theoretic methods the function(al)s provably recursive relative to Ramsey’s theore

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2013-09-25 08:51:12
115Predicate logic / Computability theory / Recursion / Logic / Theory of computation / Primitive recursive arithmetic / Primitive recursive function / Quantifier / First-order logic / Free variables and bound variables / Herbrandization

A note on the Π02–induction rule∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe-Universit¨at, Robert-Mayer-Strasse 6–10, D–60054 Frankfurt, Germany Abstract It is well–known (due to C. Parsons) that th

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 10:10:40
116Computational complexity theory / Computability theory / Structural complexity theory / Approximation algorithms / Reduction / L / Simple set / Approximation-preserving reduction

T HEOREMS AS PROBLEMS S TRONG REDUCTIONS O MNISCIENT REDUCTIONS

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2016-05-18 10:05:52
117Computability theory / Functions and mappings / Recursion / Theory of computation / Proof theory / Primitive recursive function / Continuous function / Elementary function arithmetic / Arithmetic function

Real Growth in Standard Parts of Analysis∗ Ulrich Kohlenbach Fachbereich Mathematik J.W. Goethe Universit¨at Robert-Mayer-StrFrankfurt am Main, Germany

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2014-04-08 12:00:27
118Computability theory / Theoretical computer science / Mathematical logic / Theory of computation / Mathematics / Model theory / Algorithm characterizations / operator

I NTRODUCTION T HE LST FRAMEWORK Iterative forcing and preservation of hyperimmunity

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-06-30 01:30:45
119Complexity classes / Computability theory / Effective descriptive set theory / Arithmetical hierarchy / Hierarchy / FO

On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness Ulrich Kohlenbach BRICSy

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 09:32:59
120Theoretical computer science / Mathematics / Theory of computation / Computability theory / Models of computation / Mathematical logic / Formal methods / Algorithm / Turing machine / Randomized algorithm / IP / Alan Turing

Rooter: A Methodology for the Typical Unification of Access Points and Redundancy Jeremy Stribling, Daniel Aguayo and Maxwell Krohn A BSTRACT Many physicists would agree that, had it not been for congestion control, the

Add to Reading List

Source URL: pdos.csail.mit.edu

Language: English - Date: 2005-04-09 16:37:16
UPDATE