scientific article; zbMATH DE number 1339873

From MaRDI portal
Revision as of 17:21, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4265595

zbMath0940.68050MaRDI QIDQ4265595

Neil D. Jones

Publication date: 22 September 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (43)

Generality's price: Inescapable deficiencies in machine-learned programsOn reversible Turing machines and their function universalitySome remarks on real numbers induced by first-order spectraAsymptotic Speedups, Bisimulation and Distillation (Work in Progress)Unnamed ItemFormalizing non-termination of recursive programsCharacterizing polynomial and exponential complexity classes in elementary lambda-calculusImmune Systems in Computer VirologyA decidable timeout-based extension of linear temporal logicNon-size increasing graph rewriting for natural language processingUnnamed ItemSelf-generating program specializersA complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoffSubclasses of \textsc{Ptime} interpreted by programming languagesAnalysing the implicit complexity of programs.Beta-shifts, their languages, and computabilityVerification of gap-order constraint abstractions of counter systemsUnnamed ItemUnnamed ItemA characterization of partial metrizability: Domains are quantifiable.The Power of Non-determinism in Higher-Order Implicit ComplexityUnnamed ItemFrameworks for adaptable scheduling algorithmsA characterization of alternating log time by ramified recurrenceLeast Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-CalculusProgramming in Biomolecular ComputationThe fixed point problem of a simple reversible languageComplexity spaces as quantitative domains of computationA hypercomputational alienResource control for synchronous cooperative threadsKolmogorov complexity and non-determinismThe Church-Turing Thesis over Arbitrary DomainsMonoidal computer III: a coalgebraic view of computability and complexity (extended abstract)Unbounded recursion and non-size-increasing functionsThe origins of the halting problemComplexity classes and fragments of COn the computational complexity of the languages of general symbolic dynamical systems and beta-shiftsOn the computational complexity of Longley's \(H\) functionalThe influence of domain interpretations on computational modelsLanguages, Decidability, and ComplexityProof-directed program transformation: A functional account of efficient regular expression matchingTAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICSSubrecursive equivalence relations and (non-)closure under lattice operations







This page was built for publication: