Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-02T20:30:20.204Z Has data issue: false hasContentIssue false
  • English
  • Français

Finite Automata

Published online by Cambridge University Press:  25 February 2009

F. H. George
F. H. George
Affiliation:
University of Bristol
Get access Rights & Permissions [Opens in a new window]

Extract

I would like to make some further clarifying remarks about the nature of learning machines, or finite automata as they are more generally known these days. It is clear from much that has recently been written on this subject that there are still many misunderstandings about their capacity and significance.

Type
Discussion
Information
Philosophy , Volume 33 , Issue 124 , January 1958 , pp. 57 - 59
Copyright
Copyright © The Royal Institute of Philosophy 1958

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1 Turing, A. M., On Computable Numbers, with an Application to the Entscheidungs problem. Proceedings of the London Mathematical Society, Ser. 2, Vol. 42 (1936–1937), pp. 230–265.Google Scholar

2 These are as yet unpublished.