Skip to main content Accessibility help
×
Home

Finite Automata

  • F. H. George (a1)

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.

Copyright

References

Hide All

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. 230265.

2 These are as yet unpublished.

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed