Pages that link to "Item:Q3392968"
From MaRDI portal
The following pages link to On Models of a Nondeterministic Computation (Q3392968):
Displaying 17 items.
- On regular realizability problems (Q375967) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- Non-deterministic data types: Models and implementations (Q1058286) (← links)
- On the Herbrand-Kleene universe for nondeterministic computations (Q1060011) (← links)
- A nondeterministic extension over finitely recursive process model (Q1361801) (← links)
- Natural computation and non-Turing models of computation (Q1434372) (← links)
- From decidability to undecidability by considering regular sets of instances (Q2062120) (← links)
- Automata equipped with auxiliary data structures and regular realizability problems (Q2096592) (← links)
- Computability and universal determinability of negatively representable models (Q2688330) (← links)
- Computational complexity in non-Turing models of computation: the what, the why and the how (Q2825338) (← links)
- Orbits of Linear Maps and Regular Languages (Q3007635) (← links)
- On Models of a Nondeterministic Computation (Q3392968) (← links)
- Nondeterministic polynomial-time computations and models of arithmetic (Q3476273) (← links)
- (Q3681938) (← links)
- (Q4222772) (← links)
- On the decidability of finding a positive ILP-instance in a regular set of ILP-instances (Q5918790) (← links)
- On universality of regular realizability problems (Q6660012) (← links)