Characterizations of Time-Bounded Computations by Limited Primitive Recursion

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-21545-6_20
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Primitive Recursion for Higher-Order Abstract Syntax

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

On Some Characterizations of the Partial Orderings for Bounded Operators

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2012English

Type Checking Liveness for Collaborative Processes With Bounded and Unbounded Recursion

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Automatic Result Verification by Complete Run-Time Checking of Computations

International Journal of Foundations of Computer Science
Computer Science
2001English

Recursion and Double Recursion

Bulletin of the American Mathematical Society
1948English

Bounded Query Functions With Limited Output Bits

English

Bounded Error Identification of Time-Varying Parameters by RLS Techniques

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
1994English

Time-Limited Trials

JAMA - Journal of the American Medical Association
Medicine
2012English

Time Computations in Anuran Auditory Systems

Frontiers in Physiology
Physiology
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy