Title of article
NuMachine and NuAlgebra
Author/Authors
K. K. Nambiar، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1996
Pages
3
From page
105
To page
107
Abstract
A NuMachine capable of computing any recursive function is defined as a labeled graph with certain restrictions. A NuAlgebra that goes with the machine is also discussed with examples.
Keywords
NuMachine , NuAlgebra , Recursive functions
Journal title
Computers and Mathematics with Applications
Serial Year
1996
Journal title
Computers and Mathematics with Applications
Record number
917887
Link To Document