{'fraction_non_alphanumeric': 0.023809523809523808, 'fraction_numerical': 0.004761904761904762, 'mean_word_length': 5.505154639175258, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Engineering design is a computable function

Abstract Computational abstraction of engineering design leads to an elegant theory defining (1) the process of design as an abstract model of computability, the Turing machine; (2) the artifacts of design as enumerated strings from a (possibly multidimensional) grammar; and (3) design specifications or constraints as formal state changes that govern string enumeration. Using this theory, it is shown that engineering design is a computable function. A computational methodology based on the theory is then developed that can be described as a form follows function design paradigm.