Can 'Type-2' Turing Machines with Infinite Inputs Solve More Problems?

Computer Science: Do "Type-2" Turing machines with infinite length inputs have more computational power?

Helpful? Please support me on Patreon: https://www.patreon.com/roelvandepaar

With thanks & praise to God, and with thanks to the many people who have made this project possible! | Content (except music & images) licensed under CC BY-SA https://meta.stackexchange.com/help/licensing | Music: https://www.bensound.com/licensing | Images: https://stocksnap.io/license & others | With thanks to user Mike Battaglia (cs.stackexchange.com/users/10594), user Andrej Bauer (cs.stackexchange.com/users/1329), and the Stack Exchange Network (cs.stackexchange.com/questions/92177). Trademarks are property of their respective owners. Disclaimer: All information is provided "AS IS" without warranty of any kind. You are responsible for your own actions. Please contact me if anything is amiss at Roel D.OT VandePaar A.T gmail.com