Speed-up theorems in type-2 computations using oracle Turing machines
type: Item
instance of: scholarly article
title: Speed-up theorems in type-2 computations using oracle Turing machines
zbMATH Open document ID: 1185.68331
author: Chung-Chih Li
published in: Theory of Computing Systems
publication date: 2009-10-19T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D65
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5617725
zbMATH Keywords: type-2 computation
zbMATH Keywords: oracle Turing machine
zbMATH Keywords: speed-up theorem
MaRDI profile type: Publication
full work available at URL: s00224-009-9182-x
OpenAlex ID: W2169321137
cites work: Q4023825
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: On Effective Procedures for Speeding Up Algorithms
cites work: Theories of computational complexity
cites work: Q4010352
cites work: Q3893911
cites work: Simple quadratures in the complex plane
cites work: Q3855167
cites work: On the Computational Complexity of Algorithms
cites work: A new Characterization of Type-2 Feasibility
cites work: Recursive Functionals and Quantifiers of Finite Types I
cites work: Turing-Machine Computable Functionals of Finite Types II†
cites work: Recursive Functionals and Quantifiers of Finite Types II
cites work: Computational speed-up by effective operators
cites work: Recursion on the countable functionals
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Q5573961
cites work: Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
cites work: Q4385526
cites work: The Mathematical Work of S.C.Kleene
cites work: Q4088272
DOI: 10.1007/S00224-009-9182-X
description: scientific article; zbMATH DE number 5617725