Pages that link to "Item:Q5402507"

The following pages link to Classes of computable functions defined by bounds on computation (Q5402507):

Displaying 33 items.

• Reverse complexity (Q287279) (← links)
• Comparison of identification criteria for machine inductive inference (Q585192) (← links)
• Effective category and measure in abstract complexity theory (Q672752) (← links)
• Learning recursive functions: A survey (Q924164) (← links)
• Complexity of algorithms and computations (Q1153141) (← links)
• Two types of properties for complexity measures (Q1158961) (← links)
• Almost everywhere high nonuniform complexity (Q1190985) (← links)
• Program schemata with polynomial bounded counters (Q1216043) (← links)
• Augmented loop languages and classes of computable functions (Q1219687) (← links)
• The non-renamability of honesty classes (Q1220385) (← links)
• Complexity classes of partial recursive functions (Q1221487) (← links)
• An operator embedding theorem for complexity classes of recursive functions (Q1225934) (← links)
• Polynomial and abstract subrecursive classes (Q1227276) (← links)
• On computational reducibility (Q1232281) (← links)
• Complexity-class-encoding sets (Q1237360) (← links)
• Some applications of the McCreight-Meyer algorithm in abstract complexity theory (Q1249043) (← links)
• A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
• On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings (Q2106597) (← links)
• Predicatively computable functions on sets (Q2339966) (← links)
• Relationships between nondeterministic and deterministic tape complexities (Q2537313) (← links)
• The enumerability and invariance of complexity classes (Q2545514) (← links)
• Subrecursive programming languages. II. On program size (Q2546770) (← links)
• Abstract computational complexity and cycling computations (Q2548594) (← links)
• Effective operators with no strong gaps (Q2556220) (← links)
• Degrees of computational complexity (Q2557123) (← links)
• Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems (Q4094391) (← links)
• Relativization of the Theory of Computational Complexity (Q4124321) (← links)
• The operator gap theorem in α-recursion theory (Q4198498) (← links)
• (Q4781604) (← links)
• From Logic to Theoretical Computer Science – An Update (Q5452171) (← links)
• A note on dense and nondense families of complexity classes (Q5619822) (← links)
• Speed-Ups by changing the order in which sets are enumerated (Q5623225) (← links)
• Computational complexity of random access stored program machines (Q5627619) (← links)