Computability of Recursive Functions

Cited in

(97)

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

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)