Intra-Step Interaction

For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the speaker are extending the Small-Step Characterization Theorem (that asserts the validity of the sequential version of the ASM thesis) and the Wide-Step Characterization Theorem (that asserts the validity of the parallel version of the ASM thesis) to intra-step interacting algorithms.

A later comment. This was my first talk on intra-step interactive algorithms. The intended audience was the ASM community. 174 (opens in new tab) is a later talk on this topic, and it is addressed to a general computer science audience.