Another look at computability

Informatica (Ljubljana)

Volumn 20, Issue 3, 1996, Pages 359-372

  Ipate, Florentin ^a   Holcombe, Mike ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Automata; Computability; Partial recursive function; Stack X machine; Stream function; Stream X machine

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; RECURSIVE FUNCTIONS; TURING MACHINES;

STREAM FUNCTION; X MACHINE THEORY;

COMPUTABILITY AND DECIDABILITY;

EID: 0030232117     PISSN: 03505596     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. Cole, S.N. 1971. Deterministic Pushdown Store Machines and Real-Time Computation. Journal of the Association for Computing Machinery 18: 2: 306-328.
2. Eilenberg, E. 1974. Automata, Languages and Machines. Vol. A. Academic Press.
3. Harrison, M.A. 1979. Introduction to Formal Language Theory. Addison-Wesley.
4. Holcombe, M. 1988. X-Machines as a Basis for System Specification. Software Engineering Journal 3: 2: 69-76.
5. Holcombe, M. et al. 1992-1995. Various internal reports describing case studies for X-machine specifications. Technical Reports. Department of Computer Science. University of Sheffield.
6. Ipate, F. 1995. Specification and Testing Based on X-Machines. PhD Thesis. Department of Computer Science. University of Sheffield.
7. Ipate, F. & Holcombe, M. 1995. X-Machines with Stacks. Technical Report. Department of Computer Science. University of Sheffield.
8. Ipate, F. & Holcombe, M. 1996. Test Which Are Peoved to Find All Faults. Interantional Journal of Comp. Math, (to appear).
9. Laycock, G.T. 1992. The Theory and Practice of Specification Based Software Testing. PhD Thesis. Department of Computer Science. University of Sheffield.
10. Stannett, M. 1990. X-Machines and the Halting Problem - Building a Super-Turing Machine. FACS 2: 331-341.