regular

not regular

uncertain

none of these

DSpace (1+ ⌈log2(n + 1 ⌉). (⌈ x ⌉) means the smallest integer greater than or equal to x.

DSpace (1+ ⌈log2n⌉)

DSpace ( 1+ ⌈log2n2⌉)

none of these

Writing a universal Turing machine

Determining of an arbitrary turing machine is an universal turing machine

Determining of a universal turing machine can be written for fewer than k instructions for some k

Determining of a universal turing machine and some input will halt

Carnot's function

Ricmann function

Bounded function

Ackermann's function

tape movement is confined to one direction

it has no finite state

it has the capability to remember arbitrarily long sequences of input symbols

none of these