Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy
- Journal Article
Journal / seriesJournal of complexity
Pages / Article No.
SubjectPolynomial time; Computational complexity; Small universal Turing machines; Wang’s B machine; Non-erasing Turing machines; Models of computation
Organisational unit03453 - Douglas, Rodney J.
NotesReceived 29 September 2013, Accepted 31 January 2014, Available online 14 February 2014.
MoreShow all metadata