Entity usage

Showing below up to 41 results in range #1 to #41.

1. Short Lists with Short Programs in Short Time – A Short Proof: Label: en
2. Exploiting Membrane Features to Compute: Label: en
3. Pluralism Ignored: The Church-Turing Thesis and Philosophical Practice: Label: en
4. Online Bin Packing: Old Algorithms and New Results: Label: en
5. Hyperprojective Hierarchy of qcb0-Spaces: Label: en
6. Metric-Driven Grammars and Morphogenesis (Extended Abstract): Label: en
7. An Early Completion Algorithm: Thue’s 1914 Paper on the Transformation of Symbol Sequences: Label: en
8. The Complexity of Satisfaction Problems in Reverse Mathematics: Label: en
9. On the Ramseyan Factorization Theorem: Label: en
10. On the Effectiveness of Symmetry Breaking: Label: en
11. An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations: Label: en
12. Natural Descriptions and Anthropic Bias: Extant Problems In Solomonoff Induction: Label: en
13. Lines Missing Every Random Point: Label: en
14. Early Machine Translation: Label: en
15. A Computational Model of XACML–Based Access Control Management in Distributed Networks: Label: en
16. Complexity of Operation Problems: Label: en
17. Function Spaces for Second-Order Polynomial Time: Label: en
18. Predicate Characterizations in the Polynomial-Size Hierarchy: Label: en
19. Lossiness of Communication Channels Modeled by Transducers: Label: en
20. On Maximal Block Functions of Computable η-like Linear Orderings: Label: en
21. Fit-Preserving Data Refinement of Mass-Action Reaction Networks: Label: en
22. Fixed Points and Attractors of Reaction Systems: Label: en
23. Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY: Label: en
24. Chemical Production and Molecular Computing in Addressable Reaction Compartments: Label: en
25. Deciding the Borel Complexity of Regular Tree Languages: Label: en
26. Modeling Life as Cognitive Info-computation: Label: en
27. Isomorphisms of Non-Standard Fields and Ash’s Conjecture: Label: en
28. Generic Parallel Algorithms: Label: en
29. Phase Transitions Related to the Pigeonhole Principle: Label: en
30. Learnability Thesis Does Not Entail Church’s Thesis: Label: en
31. Maximal Parallelism in Membrane Systems with Generated Membrane Boundaries: Label: en
32. Constraint Logic Programming for Resolution of Relative Time Expressions: Label: en
33. Algorithmic Randomness for Infinite Time Register Machines: Label: en
34. On the Equivalence of Automata for KAT-expressions: Label: en
35. Graph Polynomials Motivated by Gene Rearrangements in Ciliates: Label: en
36. Uniform Schemata for Proof Rules: Label: en
37. Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability: Label: en
38. Algorithms and Their Explanations: Label: en
39. How can Grammatical Inference Contribute to Computational Linguistics?: Label: en
40. Parameterized Inapproximability of Target Set Selection and Generalizations: Label: en
41. Computability and Categoricity of Ultrahomogeneous Structures: Label: en