Frequency computations and the cardinality theorem (Q4032651): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2275300 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2068666632 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A cardinality version of Beigel's nonspeedup theorem / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:45, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Frequency computations and the cardinality theorem |
scientific article |
Statements
Frequency computations and the cardinality theorem (English)
0 references
1 April 1993
0 references
recursive functions
0 references
decidability
0 references
survey
0 references
frequency computation
0 references
bounded query computations
0 references
