scientific article; zbMATH DE number 530148

zbMath0792.03027MaRDI QIDQ4285775

Douglas S. Bridges

Publication date: 17 March 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Turing machinecomputabilityrecursive functionsRice's theoremrecursion theoremrecursive function theoryAckermann's functionabstract complexity theoryeffective enumerationscomputable real numbers and functions

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (13)

On recursive bounds for the exceptional values in speed-up ⋮ The homology of \(SL_2\) of discrete valuation rings ⋮ Thompson-like groups, Reidemeister numbers, and fixed points ⋮ Tambara-Yamagami, loop groups, bundles and KK-theory ⋮ Relative order and spectrum in free and related groups ⋮ A refined scissors congruence group and the third homology of \(\operatorname{SL}_2\) ⋮ Computable preference and utility ⋮ Effective category and measure in abstract complexity theory ⋮ Effective category and measure in abstract complexity theory ⋮ Weakly complete axiomatization of exogenous quantum propositional logic ⋮ Schur multipliers and second quandle homology ⋮ Homology of \(GL_n\) over infinite fields outside the stability range ⋮ A computable version of the random signs problem and Kolmogorov complexity

This page was built for publication: