@Bubbler re codegolf.stackexchange.com/a/201760/41805, I believe the shortest tc subset of apl without ⎕ would be interesting on its own

since ⎕ isn't part of the "core" of apl

@user41805 hm, if the source can't have ⎕, is there any way to ever print a ⎕? (of course, this does not impact turing completeness, but still is an interesting question)

(related - a previous discussion, but just about golfing the challenge)

i'm pretty sure i have a turing-complete set of 8 characters that does not include ⍎, ⌶ and ⎕, but haven't finished an implementation