The following pages link to Pursuit of the Universal (Q3188234):
Displaying 37 items.
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Verifying Systems of Resource-Bounded Agents (Q3188235) (← links)
- Effective S-adic Symbolic Dynamical Systems (Q3188236) (← links)
- Reaction-Based Models of Biochemical Networks (Q3188237) (← links)
- Comparative Genomics on Artificial Life (Q3188238) (← links)
- Computability and Analysis, a Historical Approach (Q3188239) (← links)
- The Brouwer Fixed Point Theorem Revisited (Q3188240) (← links)
- Secret Sharing Schemes with Algebraic Properties and Applications (Q3188241) (← links)
- Squeezing Feasibility (Q3188242) (← links)
- Recent Advances in Non-perfect Secret Sharing Schemes (Q3188243) (← links)
- A Computational Approach to the Borwein-Ditor Theorem (Q3188245) (← links)
- Semantic Security and Key-Privacy with Random Split of St-Gen Codes (Q3188246) (← links)
- The Typical Constructible Object (Q3188247) (← links)
- Computability in Symbolic Dynamics (Q3188248) (← links)
- Using Semidirect Product of (Semi)groups in Public Key Cryptography (Q3188249) (← links)
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis (Q3188250) (← links)
- Ergodicity of Noisy Cellular Automata: The Coupling Method and Beyond (Q3188251) (← links)
- Types in Programming Languages, Between Modelling, Abstraction, and Correctness (Q3188252) (← links)
- AFCAL and the Emergence of Computer Science in France: 1957–1967 (Q3188255) (← links)
- Computable Reductions and Reverse Mathematics (Q3188256) (← links)
- Busy Beavers and Kolmogorov Complexity (Q3188257) (← links)
- The Domino Problem for Self-similar Structures (Q3188258) (← links)
- Axiomatizing Analog Algorithms (Q3188259) (← links)
- Generalized Effective Reducibility (Q3188260) (← links)
- Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility (Q3188261) (← links)
- Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262) (← links)
- Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra (Q3188263) (← links)
- A Candidate for the Generalised Real Line (Q3188265) (← links)
- Finitely Generated Semiautomatic Groups (Q3188266) (← links)
- The Boolean Algebra of Piecewise Testable Languages (Q3188268) (← links)
- On the Lattices of Effectively Open Sets (Q3188269) (← links)
- On the Executability of Interactive Computation (Q3188271) (← links)
- Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)
- The Complexity of Counting Quantifiers on Equality Languages (Q3188273) (← links)
- Baire Category Theory and Hilbert’s Tenth Problem Inside $$\mathbb {Q}$$ Q (Q3188274) (← links)
- Partial Orders and Immunity in Reverse Mathematics (Q3188275) (← links)
- A Direct Constructive Proof of a Stone-Weierstrass Theorem for Metric Spaces (Q3188276) (← links)
