scientific article; zbMATH DE number 3995657

zbMath0615.03033MaRDI QIDQ4723720

Antonín Kučera

Publication date: 1986

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

zbMATH Keywords

reducibilitydegreePeano arithmeticPost's problempriority-free method

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (21)

STRONG JUMP-TRACEABILITY ⋮ Computational processes, observers and Turing incompleteness ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ Computing from projections of random points ⋮ The complexity of recursive constraint satisfaction problems ⋮ Demuth randomness and computational complexity ⋮ An easy priority-free proof of a theorem of Friedberg ⋮ Computably enumerable sets below random sets ⋮ Characterizing the strongly jump-traceable sets via randomness ⋮ A DNC function that computes no effectively bi-immune set ⋮ GENERALIZATIONS OF THE RECURSION THEOREM ⋮ Recursively presented games and strategies ⋮ Unnamed Item ⋮ On relative randomness ⋮ Fixed-point selection functions ⋮ Precomplete numberings ⋮ Fixed point theorems for precomplete numberings ⋮ The noneffectivity of Arslanov's completeness criterion and related theorems ⋮ Another note on the join property ⋮ \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets

This page was built for publication: