Enumeration reducibility
id:
enumeration-reducibility-180-12826168
title:
Enumeration reducibility
text:
In computability theory, enumeration reducibility is a specific type of reducibility. Roughly speaking, A is enumeration-reducible to B if an enumeration of B can be algorithmically converted to an enumeration of A. In particular, if B is computably enumerable, then A also is.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Enumeration_reducibility
date created:
2020-12-17T03:00:26Z
date modified:
2024-09-05T15:18:40Z
main entity:
{"identifier":"Q104881701","url":"https://www.wikidata.org/entity/Q104881701"}
image:
fields total:
13
integrity:
14