Nonexistence of minimal pairs for generic computability
type: Item
instance of: scholarly article
title: Nonexistence of minimal pairs for generic computability
zbMATH Open document ID: 1302.03048
author: Gregory Igusa
publication date: 2013-06-24T00:00:00Z
full work available at URL: https://arxiv.org/abs/1202.2560
full work available at URL: https://projecteuclid.org/euclid.jsl/1368627062
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 6180296
zbMATH Keywords: generic computability
MaRDI profile type: Publication
OpenAlex ID: W2024128940
arXiv ID: 1202.2560
cites work: Average Case Complete Problems
cites work: Generic-case complexity, decision problems in group theory, and random walks.
cites work: ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
cites work: Average case completeness
cites work: Generic computability, Turing degrees, and asymptotic density
DOI: 10.2178/JSL.7802090
published in: Journal of Symbolic Logic
description: scientific article; zbMATH DE number 6180296