Search

Signifiable computability aims to separate what is theoretically computable from what is computable through performable processes on computers with finite amounts of memory. Real numbers and sequences thereof, data types, and instances are treated as finite texts, and memory limitations are made explicit through a requirement that the texts be stored in the available memory on the devices that manipulate them. In Part I of our investigation, we define the concepts of signification and reference of real numbers. We extend signification to number tuples, data types, and data instances and show that data structures representable as tuples of discretely finite numbers are signifiable. From the signification of real tuples, we proceed to the constructive signification of multidimensional matrices and show that any data structure representable as a multidimensional matrix of discretely finite numbers is signifiable. [ABSTRACT FROM AUTHOR]

Discusses automated information retrieval, focusing on statistical patterns expected of a pair of terms that are semantically related to each other, guided by text generation conceptualization. Examines how the tendency of a content bearing term to clump, as quantified by previously developed measures of term clumping, is influenced by the presence of other terms. (Author/LRW)

Discussion of semantic networks and ranked retrieval focuses on two models, the semantic network model with spreading activation and the vector space model with dot product. Suggests a formal method to analyze the two models in terms of their relative performance in the same universe of objects. (Author/LRW)

Several characteristics of chess are investigated with methods of computability and number theories. It is shown that for an unfinished game it is primitive recursively decidable whether the game is winnable, drawable, or absolutely losable within a specified number of future moves for the player whose turn it is to play on the last board of the game. It is also shown that there exist primitive recursive procedures to compute optimal continuations of unfinished games within specified numbers of future moves and that the set of chess games is recursive. [ABSTRACT FROM AUTHOR]

A robust and intuitive understanding of fluid mechanics—the applied science of fluid motion—is foundational within many engineering disciplines, including aerospace, chemical, civil, mechanical, naval, and ocean engineering. In‐depth knowledge of fluid mechanics is critical to safe and economical design of engineering applications employed globally everyday, such as automobiles, aircraft, and sea craft, and to meeting global 21st century engineering challenges, such as developing renewable energy sources, providing access to clean water, managing the environmental nitrogen cycle, and improving urban infrastructure. Despite the fundamental nature of fluid mechanics within the broader undergraduate engineering curriculum, students often characterize courses in fluid mechanics as mathematically onerous, conceptually difficult, and aesthetically uninteresting; anecdotally, undergraduates may choose to opt‐out of fluids engineering‐related careers based on their early experiences in fluids courses. Therefore, the continued development of new frameworks for engineering instruction in fluid mechanics is needed. Toward that end, this paper introduces mobile instructional particle image velocimetry (mI‐PIV), a low‐cost, open‐source, mobile application‐based educational tool under development for smartphones and tablets running Android. The mobile application provides learners with both technological capability and guided instruction that enables them to visualize and experiment with authentic flow fields in real time. The mI‐PIV tool is designed to generate interest in and intuition about fluid flow and to improve understanding of mathematical concepts as they relate to fluid mechanics by providing opportunities for fluids‐related active engagement and discovery in both formal and informal learning contexts. [ABSTRACT FROM AUTHOR]