P. 1
Computability and Logic Maravilhoso

Computability and Logic Maravilhoso

|Views: 89|Likes:
Published by carvalhoz

More info:

Published by: carvalhoz on Aug 03, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

11/17/2013

pdf

text

original

A numerical function is a function f defined on a set of n-tuples of natural

numbers:

Dom(f) Nn

and taking natural numbers as values:

Ran(f) N.

The positive integer n is called the arity of the numerical function; it is the

number of inputsx1,x2,...,xn required to produce an outputf(x1,x2,...,xn).

A numerical function with arity n is also called an n- ary numerical function.

(This usage arose from more traditional terminology where unary meant 1-

ary, binary meant 2 -ary, ternary meant 3-ary, etc.)

The function f is called totally defined or total iff f(x1,x2,...,xn) is

defined for all inputs (x1,x2,...,xn) i.e. iff

Dom(f) = Nn
.

When we wish to emphasize that a numerical function is not assumed to

be total we call it partially defined or simply partial. (It is important

to remember that the adjective partial is redundant: a partial numerical

function and a numerical function are the same11

thing. When we call a

function partial we do not exclude the possibility that the function is total.)

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->