{'fraction_non_alphanumeric': 0.008456659619450317, 'fraction_numerical': 0.0, 'mean_word_length': 5.2368421052631575, '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}}
A method to prove that nonlinear models can be unidentifiable

Some authors have questioned the very interest of developing methods to test nonlinear models for identifiability, and conjectured that all nonlinear models are either identifiable or trivially unidentifiable. The purpose of this short paper is two fold: first to present a method that can be used to prove that some nonlinear models are unidentifiable and second to exhibit nontrivial examples of such models.