Computability of Recursive Functions

Cited in

(97)

Computational expressiveness of genetic systems
Existential arithmetization of Diophantine equations
On the computational power of BlenX
Some general incompleteness results for partial correctness logics
Primitive iteration and unary functions
Generation of invertible functions
A process algebraic view of Linda coordination primitives
Sequence recursiveness without cylindrification and limited register machines
On the computational power of automata with time or space bounded by Ackermann's or superexponential functions
From behaviorism to neobehaviorism
A characterization of the power of vector machines
Effective proper procedures and universal classes of program schemata
A direct method for simulating partial recursive functions by Diophantine equations
On transformations of programs
Program schemes, recursion schemes, and formal languages
Predecessor machines
Comparing three semantics for Linda-like languages
Analysis issues in Petri nets with inhibitor arcs
Counter machines
The ^2 fragment of the first-order theory of atomic set constraints is _1⁰-hard
On the computational strength of pure ambient calculi
Translatability of schemas over restricted interpretations
On the expressiveness of Linda coordination primitives.
Expired data collection in shared dataspaces.
On the expressive power of movement and restriction in pure mobile ambients
The expressiveness of locally stratified programs
Process calculi as a tool for studying coordination, contracts and session types
Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
Models of quantum computation and quantum programming languages
Maze recognizing automata and nondeterministic tape complexity
Dynamic interpolation search revisited
A new order-theoretic characterisation of the polytime computable functions
Bounded variability of metric temporal logic
Minimality considerations for ordinal computers modeling constructibility
Some definitional suggestions for automata theory
Towards a theory of semantics and compilers for programming languages
Über einen Automaten mit Pufferspeicherung
The lambda-gamma calculus: A language adequate for defining recursive functions
Subrecursive programming languages. II. On program size
Sequential and jumping machines and their relation to computers
Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
Quantitative information in the tuple space coordination model
On a model of virtual address translation
Comparative analysis of the expressiveness of shared dataspace coordination
Expressiveness issues in brane calculi: a survey
From Turing machines to computer viruses
A generalised dynamical system, infinite time register machines, and \(\Pi^1_1\)-\(\mathrm{CA}_{0}\)
A simple proof of the undecidability of inhabitation in λP
From mathesis universalis to provability, computability, and constructivity
Programmed grammars with rule queues
When to move to transfer nets. On the limits of Petri nets as models for process calculi
On the expressive power of process interruption and compensation
(Tissue) P systems with cell polarity
On the expressive power of recursion, replication and iteration in process calculi
Deciding reachability problems in Turing-complete fragments of Mobile Ambients
Register machine proof of the theorem on exponential diophantine representation of enumerable sets
Beitrag zur algebraischen Rekursionstheorie
Some undecidable theories with monadic predicates and without equality
Prefix classes of krom formulae with identity
Some post canonical systems in one letter
Unconventional algorithms: complementarity of axiomatics and construction
The work of Kurt Gödel
Bemerkung zu Gurevich's Arbeit über das Entscheidungsproblem für Standardklassen
Execution traces and programming-language semantics
Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic
A survey of state vectors
Theses for computation and recursion on concrete and abstract structures
Characterizations of semantic domains for randomized algorithms
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
Conditional semi-Thue systems for presenting monoids
Technology for translating combinatorial problems into Boolean equations
On the leftmost derviation in matrix grammars
The developments of the concept of machine computability from 1936 to the 1960s
On the algorithmic complexity of static structures
The undecidability of the Turing machine immortality problem
Computability by Normal Algorithms
A New Hierarchy of Elementary Functions
On the Minimum Computation Time of Functions
Algorithmic properties of structures
Rekursionszahlen und die Grzegorczyk-Hierarchie
Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles
Alternating automatic register machines
Sleptsov nets are Turing-complete
On the expressiveness and decidability of higher-order process calculi
Undecidability of bisimilarity for Petri nets and some related problems
On the power of several queues
Turing incomputable computation
Turing's influence on programming. Book extract from ``The dawn of software engineering: from Turing to Dijkstra [Zbl 1328.68010]
Primal logic of information
A survey of classes of primitive recursive functions
Characterizations of pushdown machines in terms of time-bounded computers
Instruction sequence processing operators
A procedural theory of eye movements in doing arithmetic
Closure functions and general iterates as reflectors
On a complexity-based way of constructivizing the recursive functions
Confusion of memory

This page was built for publication: Computability of Recursive Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5729305)