| http://www.w3.org/ns/prov#value | - I deliberately designed the definition of the system so that it included both Turing machines and linear bounded automata; these are considered different classes of systems (I think most people here, including me, agree that Turing machines can be universal but linear bounded automata can not be), so this demonstrates that the finiteness or infiniteness of the tape must be part of the definition of
|
