Successful visual human-computer interaction is undecidable

DOI10.1016/S0020-0190(98)00082-9MaRDI QIDQ293299zbMATH OpenOpenAlexFDO

Authors Paolo Bottoni, Stefano Levialdi, Gheorghe Păun

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098000829?np=y

zbMATH Keywords

Post correspondence probleminteractive computingvisual languages

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Theory of computing (68Q99)

Recommendations

• scientific article; zbMATH DE number 1304448
• Analyzing, modelling, and specifying visual interaction
• scientific article; zbMATH DE number 1304458
• Interactive foundations of computing
• A theory of interactive computation

Cites work

• scientific article; zbMATH DE number 1304458 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• A note on Post's correspondence problem
• A variant of a recursively unsolvable problem

Cited in

(2)

• Analyzing, modelling, and specifying visual interaction
• Rectangular tileability and complementary tileability are undecidable

This page was built for publication: Successful visual human-computer interaction is undecidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293299)