The following pages link to (Q4265595):
Displaying 46 items.
- On reversible Turing machines and their function universality (Q303695) (← links)
- Some remarks on real numbers induced by first-order spectra (Q306827) (← links)
- Self-generating program specializers (Q407546) (← links)
- Complexity spaces as quantitative domains of computation (Q536037) (← links)
- Beta-shifts, their languages, and computability (Q633763) (← links)
- Unbounded recursion and non-size-increasing functions (Q737105) (← links)
- Complexity classes and fragments of C (Q1029017) (← links)
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts (Q1034609) (← links)
- The influence of domain interpretations on computational models (Q1036525) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- Analysing the implicit complexity of programs. (Q1401939) (← links)
- A characterization of partial metrizability: Domains are quantifiable. (Q1427788) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) (Q1798794) (← links)
- On the computational complexity of Longley's \(H\) functional (Q1827400) (← links)
- Frameworks for adaptable scheduling algorithms (Q1976517) (← links)
- A characterization of alternating log time by ramified recurrence (Q1978645) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- The origins of the halting problem (Q2043819) (← links)
- Subrecursive equivalence relations and (non-)closure under lattice operations (Q2117798) (← links)
- Generality's price: Inescapable deficiencies in machine-learned programs (Q2368918) (← links)
- Verification of gap-order constraint abstractions of counter systems (Q2435309) (← links)
- A hypercomputational alien (Q2497874) (← links)
- Resource control for synchronous cooperative threads (Q2503040) (← links)
- Computational complexity in non-Turing models of computation: the what, the why and the how (Q2825338) (← links)
- Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics (Q2873496) (← links)
- The Power of Non-determinism in Higher-Order Implicit Complexity (Q2988663) (← links)
- Immune Systems in Computer Virology (Q3195689) (← links)
- (Q3305193) (← links)
- Asymptotic Speedups, Bisimulation and Distillation (Work in Progress) (Q3455068) (← links)
- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (Q3558344) (← links)
- A decidable timeout-based extension of linear temporal logic (Q4583356) (← links)
- Non-size increasing graph rewriting for natural language processing (Q4585012) (← links)
- Term rewriting characterisation of LOGSPACE for finite and infinite data (Q4993339) (← links)
- (Q5014441) (← links)
- Proof-directed program transformation: A functional account of efficient regular expression matching (Q5016216) (← links)
- (Q5020650) (← links)
- (Q5028427) (← links)
- Programming in Biomolecular Computation (Q5404089) (← links)
- The Church-Turing Thesis over Arbitrary Domains (Q5452180) (← links)
- Languages, Decidability, and Complexity (Q5496920) (← links)
- Computational Complexity (Q5900112) (← links)
- Kolmogorov complexity and non-determinism (Q5958289) (← links)
- A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff (Q6090449) (← links)
- Subclasses of \textsc{Ptime} interpreted by programming languages (Q6109064) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
