Unbounded recursion and non-size-increasing functions (Q737105): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4934292 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Predecessor machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear types and non-size-increasing polynomial time computation. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4265595 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: LOGSPACE and PTIME characterized by programming languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The iterated mod problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Neat function algebraic characterizations of LOGSPACE and LINSPACE / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regressive computations characterize logarithmic space / rank | |||
Normal rank |
Revision as of 08:53, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Unbounded recursion and non-size-increasing functions |
scientific article |
Statements
Unbounded recursion and non-size-increasing functions (English)
0 references
5 August 2016
0 references
recursion on notation
0 references
logspace computable function
0 references
polynomial-time computable function
0 references