https://en.wikipedia.org/wiki/Turing_machine#Concurrency
Another limitation of Turing machines is that they do not model concurrency well. For example, there is a bound on the size of integer that can be computed by an always-halting nondeterministic Turing machine starting on a blank tape. (See article on unbounded nondeterminism <https://en.wikipedia.org/wiki/Unbounded_nondeterminism>.) By contrast, there are always-halting concurrent systems with no inputs that can compute an integer of unbounded size. (A process can be created with local storage that is initialized with a count of 0 that concurrently sends itself both a stop and a go message. When it receives a go message, it increments its count by 1 and sends itself a go message. When it receives a stop message, it stops with an unbounded number in its local storage.) ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/Tc33b8ed7189d2a18-Me3229af4bb283f157525d318 Delivery options: https://agi.topicbox.com/groups/agi/subscription
