ELEMENTARY
id:
elementary-259-14944790
title:
ELEMENTARY
text:
In computational complexity theory, the complexity class ELEMENTARY of elementary recursive functions is the union of the classes The name was coined by László Kalmár, in the context of recursive functions and undecidability; most problems in it are far from elementary. Some natural recursive problems lie outside ELEMENTARY, and are thus NONELEMENTARY. Most notably, there are primitive recursive problems that are not in ELEMENTARY. We know Whereas ELEMENTARY contains bounded applications of expo
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/ELEMENTARY
date created:
date modified:
2024-01-18T21:47:53Z
main entity:
{"identifier":"Q5323278","url":"https://www.wikidata.org/entity/Q5323278"}
image:
fields total:
13
integrity:
13