Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
9
views
0
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,845
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Logical Approaches to Computational Barriers
Partial Recursive Functions in Martin-Löf Type Theory
other
Author(s):
Anton Setzer
Publication date
(Print):
2006
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Recursive Rule based Visual Categorization
Author and book information
Book Chapter
Publication date (Print):
2006
Pages
: 505-515
DOI:
10.1007/11780342_51
SO-VID:
1b43ccdc-fd8d-49b6-a2cb-35e83a56c2a8
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Heap-Abstraction for an Object-Oriented Calculus with Thread Classes
pp. 11
From Constructibility and Absoluteness to Computability and Domain Independence
pp. 21
Datatype-Generic Reasoning
pp. 35
The Logical Strength of the Uniform Continuity Theorem
pp. 40
Elementary Algebraic Specifications of the Rational Function Field
pp. 55
Random Closed Sets
pp. 65
Deep Inference and Its Normal Form of Derivations
pp. 75
Logspace Complexity of Functions and Structures
pp. 85
Prefix-Like Complexities and Computability in the Limit
pp. 94
Partial Continuous Functions and Admissible Domain Representations
pp. 105
An Invariant Cost Model for the Lambda Calculus
pp. 115
On the Complexity of the Sperner Lemma
pp. 125
The Church-Turing Thesis: Consensus and Opposition
pp. 133
Gödel and the Origins of Computer Science
pp. 137
The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design
pp. 147
Turing Universality in Dynamical Systems
pp. 153
Every Sequence Is Decompressible from a Random One
pp. 163
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
pp. 173
LJQ: A Strongly Focused Calculus for Intuitionistic Logic
pp. 186
Böhm Trees, Krivine’s Machine and the Taylor Expansion of Lambda-Terms
pp. 198
What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem?
pp. 199
An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability
pp. 209
Enumeration Reducibility with Polynomial Time Bounds
pp. 221
Coinductive Proofs for Basic Real Computation
pp. 231
A Measure of Space for Computing over the Reals
pp. 241
On Graph Isomorphism for Restricted Graph Classes
pp. 257
Infinite Time Register Machines
pp. 267
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems
pp. 277
Forcing with Random Variables and Proof Complexity
pp. 279
Complexity-Theoretic Hierarchies
pp. 289
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests
pp. 297
Lower Bounds Using Kolmogorov Complexity
pp. 307
The Jump Classes of Minimal Covers
pp. 319
Space Bounds for Infinitary Computation
pp. 330
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
pp. 342
Towards a Trichotomy for Quantified H-Coloring
pp. 353
Two Open Problems on Effective Dimension
pp. 360
Optimization and Approximation Problems Related to Polynomial System Solving
pp. 368
Uncomputability Below the Real Halting Problem
pp. 378
Constraints on Hypercomputation
pp. 388
Martingale Families and Dimension in P
pp. 398
Can General Relativistic Computers Break the Turing Barrier?
pp. 413
Degrees of Weakly Computable Reals
pp. 423
Understanding and Using Spector’s Bar Recursive Interpretation of Classical Analysis
pp. 435
A Subrecursive Refinement of the Fundamental Theorem of Algebra
pp. 445
An Introduction to Program and Thread Algebra
pp. 459
Fast Quantifier Elimination Means P = NP
pp. 471
Admissible Representations in Computable Analysis
pp. 481
Do Noetherian Modules Have Noetherian Basis Functions?
pp. 490
Inverting Monotone Continuous Functions in Constructive Analysis
pp. 505
Partial Recursive Functions in Martin-Löf Type Theory
pp. 516
Partially Ordered Connectives and ∑1 1 on Finite Models
pp. 526
Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes
pp. 536
Gödel’s Conflicting Approaches to Effective Calculability
pp. 538
Co-total Enumeration Degrees
pp. 546
Relativized Degree Spectra
pp. 556
Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions
pp. 571
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines
pp. 575
Kurt Gödel and Computability Theory
pp. 584
A Computability Theory of Real Numbers
pp. 595
Primitive Recursive Selection Functions over Abstract Algebras
Similar content
3,845
A note on the Martin-Löf test for unidimensionality
Authors:
T. VERGUTS
,
P. De Boeck
Programming in Martin-Löf 's type theory
Authors:
Bengt Nordström
,
Kent Petersson
,
Jan M. Smith
Representing inductively defined sets by wellorderings in Martin-Löf's type theory
Authors:
Peter Dybjer
See all similar