scientific article; zbMATH DE number 1339873

zbMath0940.68050MaRDI QIDQ4265595

Neil D. Jones

Publication date: 22 September 1999

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

zbMATH Keywords

programming-oriented model of computation

Mathematics Subject Classification ID

Related Items (43)

Generality's price: Inescapable deficiencies in machine-learned programs ⋮ On reversible Turing machines and their function universality ⋮ Some remarks on real numbers induced by first-order spectra ⋮ Asymptotic Speedups, Bisimulation and Distillation (Work in Progress) ⋮ Unnamed Item ⋮ Formalizing non-termination of recursive programs ⋮ Characterizing polynomial and exponential complexity classes in elementary lambda-calculus ⋮ Immune Systems in Computer Virology ⋮ A decidable timeout-based extension of linear temporal logic ⋮ Non-size increasing graph rewriting for natural language processing ⋮ Unnamed Item ⋮ Self-generating program specializers ⋮ A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff ⋮ Subclasses of \textsc{Ptime} interpreted by programming languages ⋮ Analysing the implicit complexity of programs. ⋮ Beta-shifts, their languages, and computability ⋮ Verification of gap-order constraint abstractions of counter systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A characterization of partial metrizability: Domains are quantifiable. ⋮ The Power of Non-determinism in Higher-Order Implicit Complexity ⋮ Unnamed Item ⋮ Frameworks for adaptable scheduling algorithms ⋮ A characterization of alternating log time by ramified recurrence ⋮ Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus ⋮ Programming in Biomolecular Computation ⋮ The fixed point problem of a simple reversible language ⋮ Complexity spaces as quantitative domains of computation ⋮ A hypercomputational alien ⋮ Resource control for synchronous cooperative threads ⋮ Kolmogorov complexity and non-determinism ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) ⋮ Unbounded recursion and non-size-increasing functions ⋮ The origins of the halting problem ⋮ Complexity classes and fragments of C ⋮ On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts ⋮ On the computational complexity of Longley's \(H\) functional ⋮ The influence of domain interpretations on computational models ⋮ Languages, Decidability, and Complexity ⋮ Proof-directed program transformation: A functional account of efficient regular expression matching ⋮ TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS ⋮ Subrecursive equivalence relations and (non-)closure under lattice operations

This page was built for publication: